---
_id: '18030'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn;
2018.
apa: N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn.
bibtex: '@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
Paderborn}, author={N., N.}, year={2018} }'
chicago: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität
Paderborn, 2018.
ieee: N. N., Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn, 2018.
mla: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn,
2018.
short: N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.
date_created: 2020-08-18T08:44:22Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '18033'
author:
- first_name: Robin
full_name: Wulfes, Robin
last_name: Wulfes
citation:
ama: Wulfes R. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn; 2018.
apa: Wulfes, R. (2018). Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn.
bibtex: '@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken},
publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }'
chicago: Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
ieee: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
mla: Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
short: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität
Paderborn, 2018.
date_created: 2020-08-18T08:46:50Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Load-Balanced Routing in Hybriden Kommunikationsnetzwerken
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '2320'
author:
- first_name: Lars Christian
full_name: Funke, Lars Christian
last_name: Funke
citation:
ama: Funke LC. Eignungsbewertung eines Enterprise Architecture Frameworks für
das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. Universität Paderborn; 2018.
apa: Funke, L. C. (2018). Eignungsbewertung eines Enterprise Architecture Frameworks
für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. Universität Paderborn.
bibtex: '@book{Funke_2018, place={Universität Paderborn}, title={Eignungsbewertung
eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie
und IT-Landschaft am Beispiel der Arvato SCM}, author={Funke, Lars Christian},
year={2018} }'
chicago: Funke, Lars Christian. Eignungsbewertung eines Enterprise Architecture
Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft
am Beispiel der Arvato SCM. Universität Paderborn, 2018.
ieee: L. C. Funke, Eignungsbewertung eines Enterprise Architecture Frameworks
für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. Universität Paderborn, 2018.
mla: Funke, Lars Christian. Eignungsbewertung eines Enterprise Architecture Frameworks
für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM. 2018.
short: L.C. Funke, Eignungsbewertung eines Enterprise Architecture Frameworks für
das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel
der Arvato SCM, Universität Paderborn, 2018.
date_created: 2018-04-12T12:47:45Z
date_updated: 2022-01-06T06:55:47Z
language:
- iso: ger
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment
zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM
type: mastersthesis
user_id: '16205'
year: '2018'
...
---
_id: '2322'
abstract:
- lang: eng
text: "The vision of On-The-Fly Computing is an automatic composition\r\nof existing
software services. Based on natural language software\r\ndescriptions, end users
will receive compositions tailored to their needs.\r\nFor this reason, the quality
of the initial software service description\r\nstrongly determines whether a software
composition really meets the expectations\r\nof end users. In this paper, we expose
open NLP challenges\r\nneeded to be faced for service composition in On-The-Fly
Computing."
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Geierhos M. How to Deal with Inaccurate Service Descriptions in
On-The-Fly Computing: Open Challenges. In: Silberztein M, Atigui F, Kornyshova
E, Métais E, Meziane F, eds. Proceedings of the 23rd International Conference
on Natural Language and Information Systems. Vol 10859. Lecture Notes in Computer
Science. Cham, Switzerland: Springer; 2018:509-513. doi:10.1007/978-3-319-91947-8_53'
apa: 'Bäumer, F. S., & Geierhos, M. (2018). How to Deal with Inaccurate Service
Descriptions in On-The-Fly Computing: Open Challenges. In M. Silberztein, F. Atigui,
E. Kornyshova, E. Métais, & F. Meziane (Eds.), Proceedings of the 23rd
International Conference on Natural Language and Information Systems (Vol.
10859, pp. 509–513). Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-91947-8_53'
bibtex: '@inbook{Bäumer_Geierhos_2018, place={Cham, Switzerland}, series={Lecture
Notes in Computer Science}, title={How to Deal with Inaccurate Service Descriptions
in On-The-Fly Computing: Open Challenges}, volume={10859}, DOI={10.1007/978-3-319-91947-8_53},
booktitle={Proceedings of the 23rd International Conference on Natural Language
and Information Systems}, publisher={Springer}, author={Bäumer, Frederik Simon
and Geierhos, Michaela}, editor={Silberztein, Max and Atigui, Faten and Kornyshova,
Elena and Métais, Elisabeth and Meziane, Farid Editors}, year={2018}, pages={509–513},
collection={Lecture Notes in Computer Science} }'
chicago: 'Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate
Service Descriptions in On-The-Fly Computing: Open Challenges.” In Proceedings
of the 23rd International Conference on Natural Language and Information Systems,
edited by Max Silberztein, Faten Atigui, Elena Kornyshova, Elisabeth Métais,
and Farid Meziane, 10859:509–13. Lecture Notes in Computer Science. Cham, Switzerland:
Springer, 2018. https://doi.org/10.1007/978-3-319-91947-8_53.'
ieee: 'F. S. Bäumer and M. Geierhos, “How to Deal with Inaccurate Service Descriptions
in On-The-Fly Computing: Open Challenges,” in Proceedings of the 23rd International
Conference on Natural Language and Information Systems, vol. 10859, M. Silberztein,
F. Atigui, E. Kornyshova, E. Métais, and F. Meziane, Eds. Cham, Switzerland: Springer,
2018, pp. 509–513.'
mla: 'Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate
Service Descriptions in On-The-Fly Computing: Open Challenges.” Proceedings
of the 23rd International Conference on Natural Language and Information Systems,
edited by Max Silberztein et al., vol. 10859, Springer, 2018, pp. 509–13, doi:10.1007/978-3-319-91947-8_53.'
short: 'F.S. Bäumer, M. Geierhos, in: M. Silberztein, F. Atigui, E. Kornyshova,
E. Métais, F. Meziane (Eds.), Proceedings of the 23rd International Conference
on Natural Language and Information Systems, Springer, Cham, Switzerland, 2018,
pp. 509–513.'
conference:
end_date: 2018-06-18
location: Paris, France
name: 23rd International Conference on Natural Language and Information Systems
start_date: 2018-06-13
date_created: 2018-04-13T08:54:56Z
date_updated: 2022-01-06T06:55:47Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.1007/978-3-319-91947-8_53
editor:
- first_name: 'Max '
full_name: 'Silberztein, Max '
last_name: Silberztein
- first_name: 'Faten '
full_name: 'Atigui, Faten '
last_name: Atigui
- first_name: 'Elena '
full_name: 'Kornyshova, Elena '
last_name: Kornyshova
- first_name: 'Elisabeth '
full_name: 'Métais, Elisabeth '
last_name: Métais
- first_name: 'Farid '
full_name: 'Meziane, Farid '
last_name: Meziane
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:12:26Z
date_updated: 2018-11-02T16:12:26Z
file_id: '5326'
file_name: Bäumer-Geierhos2018_Chapter_HowToDealWithInaccurateService.pdf
file_size: 327508
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:12:26Z
has_accepted_license: '1'
intvolume: ' 10859'
keyword:
- Requirements Extraction
- Temporal Reordering of Software Functions
- Inaccuracy Compensation
language:
- iso: eng
page: 509-513
place: Cham, Switzerland
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 23rd International Conference on Natural Language
and Information Systems
publication_identifier:
isbn:
- 978-3-319-91946-1
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: 'How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing:
Open Challenges'
type: book_chapter
user_id: '477'
volume: 10859
year: '2018'
...
---
_id: '2331'
abstract:
- lang: eng
text: A user generally writes software requirements in ambiguous and incomplete
form by using natural language; therefore, a software developer may have difficulty
in clearly understanding what the meanings are. To solve this problem with automation,
we propose a classifier for semantic annotation with manually pre-defined semantic
categories. To improve our classifier, we carefully designed syntactic features
extracted by constituency and dependency parsers. Even with a small dataset and
a large number of classes, our proposed classifier records an accuracy of 0.75,
which outperforms the previous model, REaCT.
article_type: original
author:
- first_name: 'Yeongsu '
full_name: 'Kim, Yeongsu '
last_name: Kim
- first_name: Seungwoo
full_name: Lee, Seungwoo
last_name: Lee
- first_name: Markus
full_name: Dollmann, Markus
id: '27578'
last_name: Dollmann
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: Kim Y, Lee S, Dollmann M, Geierhos M. Improving Classifiers for Semantic Annotation
of Software Requirements with Elaborate Syntactic Structure. International
Journal of Advanced Science and Technology. 2018;112:123-136. doi:10.14257/ijast.2018.112.12
apa: Kim, Y., Lee, S., Dollmann, M., & Geierhos, M. (2018). Improving Classifiers
for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure.
International Journal of Advanced Science and Technology, 112, 123–136.
https://doi.org/10.14257/ijast.2018.112.12
bibtex: '@article{Kim_Lee_Dollmann_Geierhos_2018, title={Improving Classifiers for
Semantic Annotation of Software Requirements with Elaborate Syntactic Structure},
volume={112}, DOI={10.14257/ijast.2018.112.12},
journal={International Journal of Advanced Science and Technology}, publisher={SERSC
Australia}, author={Kim, Yeongsu and Lee, Seungwoo and Dollmann, Markus and Geierhos,
Michaela}, year={2018}, pages={123–136} }'
chicago: 'Kim, Yeongsu , Seungwoo Lee, Markus Dollmann, and Michaela Geierhos. “Improving
Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic
Structure.” International Journal of Advanced Science and Technology 112
(2018): 123–36. https://doi.org/10.14257/ijast.2018.112.12.'
ieee: Y. Kim, S. Lee, M. Dollmann, and M. Geierhos, “Improving Classifiers for Semantic
Annotation of Software Requirements with Elaborate Syntactic Structure,” International
Journal of Advanced Science and Technology, vol. 112, pp. 123–136, 2018.
mla: Kim, Yeongsu, et al. “Improving Classifiers for Semantic Annotation of Software
Requirements with Elaborate Syntactic Structure.” International Journal of
Advanced Science and Technology, vol. 112, SERSC Australia, 2018, pp. 123–36,
doi:10.14257/ijast.2018.112.12.
short: Y. Kim, S. Lee, M. Dollmann, M. Geierhos, International Journal of Advanced
Science and Technology 112 (2018) 123–136.
date_created: 2018-04-13T09:19:22Z
date_updated: 2022-01-06T06:55:49Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.14257/ijast.2018.112.12
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:16:29Z
date_updated: 2018-11-02T15:16:29Z
file_id: '5297'
file_name: 12.pdf
file_size: 586968
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:16:29Z
has_accepted_license: '1'
intvolume: ' 112'
keyword:
- Software Engineering
- Natural Language Processing
- Semantic Annotation
- Machine Learning
- Feature Engineering
- Syntactic Structure
language:
- iso: eng
page: 123-136
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: International Journal of Advanced Science and Technology
publication_identifier:
eissn:
- 2207-6360
issn:
- 2005-4238
publication_status: published
publisher: SERSC Australia
quality_controlled: '1'
status: public
title: Improving Classifiers for Semantic Annotation of Software Requirements with
Elaborate Syntactic Structure
type: journal_article
user_id: '477'
volume: 112
year: '2018'
...
---
_id: '8074'
author:
- first_name: Cengiz
full_name: Aykanat, Cengiz
last_name: Aykanat
citation:
ama: Aykanat C. Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht.
Universität Paderborn; 2018.
apa: Aykanat, C. (2018). Sharing Economy - Chancen und Risiken aus ökonomischer
Sicht. Universität Paderborn.
bibtex: '@book{Aykanat_2018, title={Sharing Economy - Chancen und Risiken aus ökonomischer
Sicht}, publisher={Universität Paderborn}, author={Aykanat, Cengiz}, year={2018}
}'
chicago: Aykanat, Cengiz. Sharing Economy - Chancen Und Risiken Aus Ökonomischer
Sicht. Universität Paderborn, 2018.
ieee: C. Aykanat, Sharing Economy - Chancen und Risiken aus ökonomischer Sicht.
Universität Paderborn, 2018.
mla: Aykanat, Cengiz. Sharing Economy - Chancen Und Risiken Aus Ökonomischer
Sicht. Universität Paderborn, 2018.
short: C. Aykanat, Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht,
Universität Paderborn, 2018.
date_created: 2019-02-22T09:40:39Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Sharing Economy - Chancen und Risiken aus ökonomischer Sicht
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '8075'
author:
- first_name: Tatiana
full_name: Suvorina, Tatiana
last_name: Suvorina
citation:
ama: Suvorina T. Heterogeneity in Contests, Sources and Implicants. Universität
Paderborn; 2018.
apa: Suvorina, T. (2018). Heterogeneity in Contests, Sources and Implicants.
Universität Paderborn.
bibtex: '@book{Suvorina_2018, title={Heterogeneity in Contests, Sources and Implicants},
publisher={Universität Paderborn}, author={Suvorina, Tatiana}, year={2018} }'
chicago: Suvorina, Tatiana. Heterogeneity in Contests, Sources and Implicants.
Universität Paderborn, 2018.
ieee: T. Suvorina, Heterogeneity in Contests, Sources and Implicants. Universität
Paderborn, 2018.
mla: Suvorina, Tatiana. Heterogeneity in Contests, Sources and Implicants.
Universität Paderborn, 2018.
short: T. Suvorina, Heterogeneity in Contests, Sources and Implicants, Universität
Paderborn, 2018.
date_created: 2019-02-22T09:47:28Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Heterogeneity in Contests, Sources and Implicants
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '5693'
author:
- first_name: Helena
full_name: Graf, Helena
id: '52640'
last_name: Graf
citation:
ama: Graf H. Ranking of Classification Algorithms in AutoML. Universität
Paderborn; 2018.
apa: Graf, H. (2018). Ranking of Classification Algorithms in AutoML. Universität
Paderborn.
bibtex: '@book{Graf_2018, title={Ranking of Classification Algorithms in AutoML},
publisher={Universität Paderborn}, author={Graf, Helena}, year={2018} }'
chicago: Graf, Helena. Ranking of Classification Algorithms in AutoML. Universität
Paderborn, 2018.
ieee: H. Graf, Ranking of Classification Algorithms in AutoML. Universität
Paderborn, 2018.
mla: Graf, Helena. Ranking of Classification Algorithms in AutoML. Universität
Paderborn, 2018.
short: H. Graf, Ranking of Classification Algorithms in AutoML, Universität Paderborn,
2018.
date_created: 2018-11-15T08:06:41Z
date_updated: 2022-01-06T07:02:35Z
department:
- _id: '355'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
title: Ranking of Classification Algorithms in AutoML
type: bachelorsthesis
user_id: '33176'
year: '2018'
...
---
_id: '5772'
author:
- first_name: Patrizia
full_name: Fanasch, Patrizia
last_name: Fanasch
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
citation:
ama: Fanasch P, Frick B. What Makes Cooperatives Successful? Identifying the Determinants
of Their Organizational Performance. Journal of Wine Economics. 2018:1-27.
doi:10.1017/jwe.2018.28
apa: Fanasch, P., & Frick, B. (2018). What Makes Cooperatives Successful? Identifying
the Determinants of Their Organizational Performance. Journal of Wine Economics,
1–27. https://doi.org/10.1017/jwe.2018.28
bibtex: '@article{Fanasch_Frick_2018, title={What Makes Cooperatives Successful?
Identifying the Determinants of Their Organizational Performance}, DOI={10.1017/jwe.2018.28},
journal={Journal of Wine Economics}, publisher={Cambridge University Press (CUP)},
author={Fanasch, Patrizia and Frick, Bernd}, year={2018}, pages={1–27} }'
chicago: Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful?
Identifying the Determinants of Their Organizational Performance.” Journal
of Wine Economics, 2018, 1–27. https://doi.org/10.1017/jwe.2018.28.
ieee: P. Fanasch and B. Frick, “What Makes Cooperatives Successful? Identifying
the Determinants of Their Organizational Performance,” Journal of Wine Economics,
pp. 1–27, 2018.
mla: Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful? Identifying
the Determinants of Their Organizational Performance.” Journal of Wine Economics,
Cambridge University Press (CUP), 2018, pp. 1–27, doi:10.1017/jwe.2018.28.
short: P. Fanasch, B. Frick, Journal of Wine Economics (2018) 1–27.
date_created: 2018-11-21T09:45:21Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '330'
department:
- _id: '183'
doi: 10.1017/jwe.2018.28
file:
- access_level: closed
content_type: application/pdf
creator: bhoyer
date_created: 2018-11-21T09:46:42Z
date_updated: 2018-11-21T09:46:42Z
file_id: '5773'
file_name: fanasch_frick_jwe_2018.pdf
file_size: 291759
relation: main_file
file_date_updated: 2018-11-21T09:46:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-27
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Journal of Wine Economics
publication_identifier:
issn:
- 1931-4361
- 1931-437X
publication_status: epub_ahead
publisher: Cambridge University Press (CUP)
status: public
title: What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational
Performance
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '5774'
abstract:
- lang: eng
text: Information flow analysis investigates the flow of data in applications, checking
in particular for flows from private sources to public sinks. Flow- and path-sensitive
analyses are, however, often too costly to be performed every time a security-critical
application is run. In this paper, we propose a variant of proof carrying code
for information flow security. To this end, we develop information flow (IF) certificates
which get attached to programs as well as a method for IF certificate validation.
We prove soundness of our technique, i.e., show it to be tamper-free. The technique
is implemented within the program analysis tool CPAchecker. Our experiments confirm
that the use of certificates pays off for costly analysis runs.
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Information Flow Certificates. In: Theoretical Aspects
of Computing – ICTAC 2018. Cham: Springer International Publishing; 2018:435-454.
doi:10.1007/978-3-030-02508-3_23'
apa: 'Töws, M., & Wehrheim, H. (2018). Information Flow Certificates. In Theoretical
Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-030-02508-3_23'
bibtex: '@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow
Certificates}, DOI={10.1007/978-3-030-02508-3_23},
booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer
International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018},
pages={435–454} }'
chicago: 'Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In
Theoretical Aspects of Computing – ICTAC 2018, 435–54. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-030-02508-3_23.'
ieee: M. Töws and H. Wehrheim, “Information Flow Certificates,” in Theoretical
Aspects of Computing – ICTAC 2018, 2018, pp. 435–454.
mla: Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” Theoretical
Aspects of Computing – ICTAC 2018, Springer International Publishing, 2018,
pp. 435–54, doi:10.1007/978-3-030-02508-3_23.
short: 'M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018,
Springer International Publishing, Cham, 2018, pp. 435–454.'
date_created: 2018-11-21T09:51:37Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-030-02508-3_23
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:11:32Z
date_updated: 2018-11-26T15:11:32Z
file_id: '5837'
file_name: Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf
file_size: 518016
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:11:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-454
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Theoretical Aspects of Computing – ICTAC 2018
publication_identifier:
isbn:
- '9783030025076'
- '9783030025083'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Information Flow Certificates
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5820'
abstract:
- lang: eng
text: "In this paper, we investigate the use of trusted execution environments (TEEs,
such as Intel's SGX) for an anonymous communication infrastructure over untrusted
networks.\r\nFor this, we present the general idea of exploiting trusted execution
environments for the purpose of anonymous communication, including a continuous-time
security framework that models strong anonymity guarantees in the presence of
an adversary that observes all network traffic and can adaptively corrupt a constant
fraction of participating nodes.\r\nIn our framework, a participating node can
generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms,
allowing both senders and receivers of messages to remain anonymous. We introduce
a concrete construction, which shows viability of our TEE-based approach to anonymous
communication. The construction draws from techniques from cryptography and overlay
networks. \r\nOur techniques are very general and can be used as a basis for future
constructions with similar goals."
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication
Based on Trusted Execution Environments.
apa: Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably
Anonymous Communication Based on Trusted Execution Environments.
bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication
Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz,
Jan and Scheideler, Christian and Setzer, Alexander} }'
chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer.
Provably Anonymous Communication Based on Trusted Execution Environments,
n.d.
ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous
Communication Based on Trusted Execution Environments. .
mla: Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted
Execution Environments.
short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication
Based on Trusted Execution Environments, n.d.
date_created: 2018-11-25T08:08:40Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2018-12-31T09:55:30Z
date_updated: 2018-12-31T09:55:30Z
file_id: '6435'
file_name: draft-2018.pdf
file_size: 470968
relation: main_file
success: 1
file_date_updated: 2018-12-31T09:55:30Z
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
publication_status: draft
status: public
title: Provably Anonymous Communication Based on Trusted Execution Environments
type: working_paper
user_id: '27207'
year: '2018'
...
---
_id: '5936'
author:
- first_name: Manuel
full_name: Scheibl, Manuel
last_name: Scheibl
citation:
ama: Scheibl M. Learning about Learning Curves from Dataset Properties. Universität
Paderborn; 2018.
apa: Scheibl, M. (2018). Learning about learning curves from dataset properties.
Universität Paderborn.
bibtex: '@book{Scheibl_2018, title={Learning about learning curves from dataset
properties}, publisher={Universität Paderborn}, author={Scheibl, Manuel}, year={2018}
}'
chicago: Scheibl, Manuel. Learning about Learning Curves from Dataset Properties.
Universität Paderborn, 2018.
ieee: M. Scheibl, Learning about learning curves from dataset properties.
Universität Paderborn, 2018.
mla: Scheibl, Manuel. Learning about Learning Curves from Dataset Properties.
Universität Paderborn, 2018.
short: M. Scheibl, Learning about Learning Curves from Dataset Properties, Universität
Paderborn, 2018.
date_created: 2018-11-28T10:29:53Z
date_updated: 2022-01-06T07:02:47Z
department:
- _id: '355'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
title: Learning about learning curves from dataset properties
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5967'
author:
- first_name: Alexander
full_name: Koch, Alexander
last_name: Koch
citation:
ama: Koch A. Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung.
Universität Paderborn; 2018.
apa: Koch, A. (2018). Reduzierung des Energieverlustes im Smart Grid mittels
Koalitionsbildung. Universität Paderborn.
bibtex: '@book{Koch_2018, title={Reduzierung des Energieverlustes im Smart Grid
mittels Koalitionsbildung}, publisher={Universität Paderborn}, author={Koch, Alexander},
year={2018} }'
chicago: Koch, Alexander. Reduzierung des Energieverlustes im Smart Grid mittels
Koalitionsbildung. Universität Paderborn, 2018.
ieee: A. Koch, Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung.
Universität Paderborn, 2018.
mla: Koch, Alexander. Reduzierung des Energieverlustes im Smart Grid mittels
Koalitionsbildung. Universität Paderborn, 2018.
short: A. Koch, Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung,
Universität Paderborn, 2018.
date_created: 2018-11-28T12:07:30Z
date_updated: 2022-01-06T07:02:48Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung
type: bachelorsthesis
user_id: '65453'
year: '2018'
...
---
_id: '5984'
alternative_title:
- Special Issue of SIROCCO 2015
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Preface. Theor Comput Sci. 2018;751:1. doi:10.1016/j.tcs.2018.11.004
apa: Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1.
https://doi.org/10.1016/j.tcs.2018.11.004
bibtex: '@article{Scheideler_2018, title={Preface}, volume={751}, DOI={10.1016/j.tcs.2018.11.004},
journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1}
}'
chicago: 'Scheideler, Christian. “Preface.” Theor. Comput. Sci. 751 (2018):
1. https://doi.org/10.1016/j.tcs.2018.11.004.'
ieee: C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018.
mla: Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018,
p. 1, doi:10.1016/j.tcs.2018.11.004.
short: C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.
date_created: 2018-11-30T08:08:23Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2018.11.004
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2019-01-11T10:20:16Z
date_updated: 2019-01-11T10:20:16Z
file_id: '6620'
file_name: Preface.pdf
file_size: 112676
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:20:16Z
has_accepted_license: '1'
intvolume: ' 751'
language:
- iso: eng
page: '1'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theor. Comput. Sci.
status: public
title: Preface
type: journal_article
user_id: '15504'
volume: 751
year: '2018'
...
---
_id: '5985'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing.
In: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018. ; 2018:1-2. doi:10.1145/3229774.3229781'
apa: 'Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure
Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018 (pp. 1–2). https://doi.org/10.1145/3229774.3229781'
bibtex: '@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for
Robust and Secure Fog Computing}, DOI={10.1145/3229774.3229781},
booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }'
chicago: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” In Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 1–2, 2018. https://doi.org/10.1145/3229774.3229781.'
ieee: 'C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,”
in Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud,
Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July
27, 2018, 2018, pp. 1–2.'
mla: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
Fog Computing.” Proceedings of the 2018 Workshop on Theory and Practice for
Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
Kingdom, July 27, 2018, 2018, pp. 1–2, doi:10.1145/3229774.3229781.'
short: 'C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice
for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
United Kingdom, July 27, 2018, 2018, pp. 1–2.'
date_created: 2018-11-30T08:11:27Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3229774.3229781
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:12:02Z
date_updated: 2018-12-12T15:12:02Z
file_id: '6194'
file_name: p1-scheideler.pdf
file_size: 1420210
relation: main_file
file_date_updated: 2018-12-12T15:12:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-2
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
July 27, 2018
status: public
title: 'Relays: Towards a Link Layer for Robust and Secure Fog Computing'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '6016'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. Understand your chains and keep your deadlines: Introducing
time-constrained profiling for NFV. In: IEEE/IFIP 14th International Conference
on Network and Service Management (CNSM). Rome: IEEE/IFIP.'
apa: 'Peuster, M., & Karl, H. (n.d.). Understand your chains and keep your deadlines:
Introducing time-constrained profiling for NFV. In IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM). Rome: IEEE/IFIP.'
bibtex: '@inproceedings{Peuster_Karl, place={Rome}, title={Understand your chains
and keep your deadlines: Introducing time-constrained profiling for NFV}, booktitle={IEEE/IFIP
14th International Conference on Network and Service Management (CNSM)}, publisher={IEEE/IFIP},
author={Peuster, Manuel and Karl, Holger} }'
chicago: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your
Deadlines: Introducing Time-Constrained Profiling for NFV.” In IEEE/IFIP 14th
International Conference on Network and Service Management (CNSM). Rome: IEEE/IFIP,
n.d.'
ieee: 'M. Peuster and H. Karl, “Understand your chains and keep your deadlines:
Introducing time-constrained profiling for NFV,” in IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM), Rome.'
mla: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your Deadlines:
Introducing Time-Constrained Profiling for NFV.” IEEE/IFIP 14th International
Conference on Network and Service Management (CNSM), IEEE/IFIP.'
short: 'M. Peuster, H. Karl, in: IEEE/IFIP 14th International Conference on Network
and Service Management (CNSM), IEEE/IFIP, Rome, n.d.'
conference:
end_date: 2018-11-09
location: Rome
name: IEEE/IFIP 14th International Conference on Network and Service Management
(CNSM)
start_date: 2018-11-05
date_created: 2018-12-06T12:06:14Z
date_updated: 2022-01-06T07:02:50Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-12-06T12:05:37Z
date_updated: 2018-12-06T12:05:37Z
file_id: '6017'
file_name: main_copy_for_ris.pdf
file_size: 961004
relation: main_file
file_date_updated: 2018-12-06T12:05:37Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8584974
oa: '1'
place: Rome
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '15'
name: SFB 901 - Subproject C3
publication: IEEE/IFIP 14th International Conference on Network and Service Management
(CNSM)
publication_status: accepted
publisher: IEEE/IFIP
status: public
title: 'Understand your chains and keep your deadlines: Introducing time-constrained
profiling for NFV'
type: conference
user_id: '13271'
year: '2018'
...
---
_id: '63'
author:
- first_name: Ernst
full_name: Althaus, Ernst
last_name: Althaus
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Jiri
full_name: Sgall, Jiri
last_name: Sgall
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources
on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0
apa: Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L.,
Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous
Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0
bibtex: '@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018,
title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0},
number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus,
Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm
and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018},
pages={77–92} }'
chicago: 'Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der
Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared
Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018):
77–92. https://doi.org/10.1007/s10951-017-0518-0.'
ieee: 'E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,”
Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.'
mla: Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.
short: E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S.
Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:00Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10951-017-0518-0
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:16:59Z
date_updated: 2018-03-21T13:16:59Z
file_id: '1577'
file_name: 63-main_05.pdf
file_size: 466808
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:16:59Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 77-92
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Scheduling
publisher: Springer
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: journal_article
user_id: '15415'
volume: 21
year: '2018'
...
---
_id: '6423'
author:
- first_name: Dirk
full_name: Schäfer, Dirk
last_name: Schäfer
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Schäfer D, Hüllermeier E. Preference-Based Reinforcement Learning Using Dyad
Ranking. In: Discovery Science. Cham: Springer International Publishing;
2018:161-175. doi:10.1007/978-3-030-01771-2_11'
apa: 'Schäfer, D., & Hüllermeier, E. (2018). Preference-Based Reinforcement
Learning Using Dyad Ranking. In Discovery Science (pp. 161–175). Cham:
Springer International Publishing. https://doi.org/10.1007/978-3-030-01771-2_11'
bibtex: '@inbook{Schäfer_Hüllermeier_2018, place={Cham}, title={Preference-Based
Reinforcement Learning Using Dyad Ranking}, DOI={10.1007/978-3-030-01771-2_11},
booktitle={Discovery Science}, publisher={Springer International Publishing},
author={Schäfer, Dirk and Hüllermeier, Eyke}, year={2018}, pages={161–175} }'
chicago: 'Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning
Using Dyad Ranking.” In Discovery Science, 161–75. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-030-01771-2_11.'
ieee: 'D. Schäfer and E. Hüllermeier, “Preference-Based Reinforcement Learning Using
Dyad Ranking,” in Discovery Science, Cham: Springer International Publishing,
2018, pp. 161–175.'
mla: Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning
Using Dyad Ranking.” Discovery Science, Springer International Publishing,
2018, pp. 161–75, doi:10.1007/978-3-030-01771-2_11.
short: 'D. Schäfer, E. Hüllermeier, in: Discovery Science, Springer International
Publishing, Cham, 2018, pp. 161–175.'
date_created: 2018-12-20T15:52:03Z
date_updated: 2022-01-06T07:03:04Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1007/978-3-030-01771-2_11
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T11:03:50Z
date_updated: 2019-01-11T11:03:50Z
file_id: '6623'
file_name: Schäfer-Hüllermeier2018_Chapter_Preference-BasedReinforcementL.pdf
file_size: 458972
relation: main_file
success: 1
file_date_updated: 2019-01-11T11:03:50Z
has_accepted_license: '1'
language:
- iso: eng
page: 161-175
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Discovery Science
publication_identifier:
isbn:
- '9783030017705'
- '9783030017712'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Preference-Based Reinforcement Learning Using Dyad Ranking
type: book_chapter
user_id: '49109'
year: '2018'
...
---
_id: '4411'
abstract:
- lang: eng
text: "While a lot of research in distributed computing has covered solutions for
self-stabilizing computing and topologies, there is far less work on self-stabilization
for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
networks, it should not be taken for granted that a distributed data structure
remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
structure has a wide area of applications including string matching problems while
offering low overhead and efficient operations when embedded on top of a distributed
hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
|x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
is the number of bits needed for storing all keys."
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes
of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1'
apa: 'Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1'
bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
year={2018}, collection={Lecture Notes of Computer Science} }'
chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi
and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
2018. https://doi.org/10.1007/978-3-030-03232-6_1.
ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
in Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr
Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
of the 20th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
end_date: 2018-11-07
location: Tokyo
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS)
start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
full_name: Izumi, Taisuke
last_name: Izumi
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
external_id:
arxiv:
- '1809.04923'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:38:37Z
date_updated: 2018-11-02T14:38:37Z
file_id: '5277'
file_name: ASelf-stabilizingHashedPatrici.pdf
file_size: 500005
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: ' 11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
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 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '4520'
author:
- first_name: Jürgen
full_name: Neumann, Jürgen
id: '32456'
last_name: Neumann
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem - Exploring
the Relationship Between Offline Locations and Online Rating Behavior. In: Workshop
on IS Design and Economic Behavior (ISDEB). ; 2018.'
apa: Neumann, J., Gutt, D., & Kundisch, D. (2018). The Traveling Reviewer Problem
- Exploring the Relationship Between Offline Locations and Online Rating Behavior.
In Workshop on IS Design and Economic Behavior (ISDEB). Lüneburg, Germany.
bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2018, title={The Traveling Reviewer
Problem - Exploring the Relationship Between Offline Locations and Online Rating
Behavior}, booktitle={Workshop on IS Design and Economic Behavior (ISDEB)}, author={Neumann,
Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2018} }'
chicago: Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer
Problem - Exploring the Relationship Between Offline Locations and Online Rating
Behavior.” In Workshop on IS Design and Economic Behavior (ISDEB), 2018.
ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem - Exploring
the Relationship Between Offline Locations and Online Rating Behavior,” in Workshop
on IS Design and Economic Behavior (ISDEB), Lüneburg, Germany, 2018.
mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem - Exploring the Relationship
Between Offline Locations and Online Rating Behavior.” Workshop on IS Design
and Economic Behavior (ISDEB), 2018.
short: 'J. Neumann, D. Gutt, D. Kundisch, in: Workshop on IS Design and Economic
Behavior (ISDEB), 2018.'
conference:
location: Lüneburg, Germany
name: Workshop on IS Design and Economic Behavior (ISDEB)
date_created: 2018-09-19T14:41:49Z
date_updated: 2022-01-06T07:01:08Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2018-11-12T10:36:41Z
date_updated: 2018-11-12T10:36:41Z
file_id: '5490'
file_name: WP_TRP.pdf
file_size: 694342
relation: main_file
success: 1
file_date_updated: 2018-11-12T10:36:41Z
has_accepted_license: '1'
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: Workshop on IS Design and Economic Behavior (ISDEB)
status: public
title: The Traveling Reviewer Problem - Exploring the Relationship Between Offline
Locations and Online Rating Behavior
type: conference_abstract
user_id: '477'
year: '2018'
...