---
_id: '415'
author:
- first_name: Shafi
  full_name: Vijapurwala, Shafi
  last_name: Vijapurwala
citation:
  ama: Vijapurwala S. <i>Handling Incomplete Service Specifications Using Fuzzy Matching</i>.
    Universität Paderborn; 2014.
  apa: Vijapurwala, S. (2014). <i>Handling Incomplete Service Specifications using
    Fuzzy Matching</i>. Universität Paderborn.
  bibtex: '@book{Vijapurwala_2014, title={Handling Incomplete Service Specifications
    using Fuzzy Matching}, publisher={Universität Paderborn}, author={Vijapurwala,
    Shafi}, year={2014} }'
  chicago: Vijapurwala, Shafi. <i>Handling Incomplete Service Specifications Using
    Fuzzy Matching</i>. Universität Paderborn, 2014.
  ieee: S. Vijapurwala, <i>Handling Incomplete Service Specifications using Fuzzy
    Matching</i>. Universität Paderborn, 2014.
  mla: Vijapurwala, Shafi. <i>Handling Incomplete Service Specifications Using Fuzzy
    Matching</i>. Universität Paderborn, 2014.
  short: S. Vijapurwala, Handling Incomplete Service Specifications Using Fuzzy Matching,
    Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:25Z
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Handling Incomplete Service Specifications using Fuzzy Matching
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '416'
author:
- first_name: Pascal
  full_name: Bemmann, Pascal
  id: '32571'
  last_name: Bemmann
citation:
  ama: Bemmann P. <i>Group Signature Schemes with Strong Exculpability</i>. Universität
    Paderborn; 2014.
  apa: Bemmann, P. (2014). <i>Group Signature Schemes with Strong Exculpability</i>.
    Universität Paderborn.
  bibtex: '@book{Bemmann_2014, title={Group Signature Schemes with Strong Exculpability},
    publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2014} }'
  chicago: Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>.
    Universität Paderborn, 2014.
  ieee: P. Bemmann, <i>Group Signature Schemes with Strong Exculpability</i>. Universität
    Paderborn, 2014.
  mla: Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>.
    Universität Paderborn, 2014.
  short: P. Bemmann, Group Signature Schemes with Strong Exculpability, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:26Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Group Signature Schemes with Strong Exculpability
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '417'
abstract:
- lang: eng
  text: 'Model transformation is a key concept in modeldrivensoftware engineering.
    The definition of model transformationsis usually based on meta-models describing
    the abstractsyntax of languages. While meta-models are thereby able to abstractfrom
    superfluous details of concrete syntax, they often loosestructural information
    inherent in languages, like information onmodel elements always occurring together
    in particular shapes.As a consequence, model transformations cannot naturally
    re-uselanguage structures, thus leading to unnecessary complexity intheir development
    as well as analysis.In this paper, we propose a new approach to model transformationdevelopment
    which allows to simplify and improve thequality of the developed transformations
    via the exploitation ofthe languages’ structures. The approach is based on context-freegrammars
    and transformations defined by pairing productions ofsource and target grammars.
    We show that such transformationsexhibit three important characteristics: they
    are sound, completeand deterministic.'
author:
- first_name: Galina
  full_name: Besova, Galina
  last_name: Besova
- first_name: Dominik
  full_name: Steenke, Dominik
  last_name: Steenke
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Besova G, Steenke D, Wehrheim H. Grammar-based model transformations. In:
    <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>.
    ; 2014:1601-1610. doi:<a href="https://doi.org/10.1016/j.cl.2015.05.003">10.1016/j.cl.2015.05.003</a>'
  apa: Besova, G., Steenke, D., &#38; Wehrheim, H. (2014). Grammar-based model transformations.
    In <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development
    (MDASD)</i> (pp. 1601–1610). <a href="https://doi.org/10.1016/j.cl.2015.05.003">https://doi.org/10.1016/j.cl.2015.05.003</a>
  bibtex: '@inproceedings{Besova_Steenke_Wehrheim_2014, title={Grammar-based model
    transformations}, DOI={<a href="https://doi.org/10.1016/j.cl.2015.05.003">10.1016/j.cl.2015.05.003</a>},
    booktitle={Proceedings 3rd Workshop on Model Driven Approaches in System Development
    (MDASD)}, author={Besova, Galina and Steenke, Dominik and Wehrheim, Heike}, year={2014},
    pages={1601–1610} }'
  chicago: Besova, Galina, Dominik Steenke, and Heike Wehrheim. “Grammar-Based Model
    Transformations.” In <i>Proceedings 3rd Workshop on Model Driven Approaches in
    System Development (MDASD)</i>, 1601–10, 2014. <a href="https://doi.org/10.1016/j.cl.2015.05.003">https://doi.org/10.1016/j.cl.2015.05.003</a>.
  ieee: G. Besova, D. Steenke, and H. Wehrheim, “Grammar-based model transformations,”
    in <i>Proceedings 3rd Workshop on Model Driven Approaches in System Development
    (MDASD)</i>, 2014, pp. 1601–1610.
  mla: Besova, Galina, et al. “Grammar-Based Model Transformations.” <i>Proceedings
    3rd Workshop on Model Driven Approaches in System Development (MDASD)</i>, 2014,
    pp. 1601–10, doi:<a href="https://doi.org/10.1016/j.cl.2015.05.003">10.1016/j.cl.2015.05.003</a>.
  short: 'G. Besova, D. Steenke, H. Wehrheim, in: Proceedings 3rd Workshop on Model
    Driven Approaches in System Development (MDASD), 2014, pp. 1601–1610.'
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:28Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.cl.2015.05.003
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:33:33Z
  date_updated: 2018-03-16T11:33:33Z
  file_id: '1360'
  file_name: 417-main.pdf
  file_size: 643382
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:33:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1601-1610
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings 3rd Workshop on Model Driven Approaches in System Development
  (MDASD)
status: public
title: Grammar-based model transformations
type: conference
user_id: '477'
year: '2014'
...
---
_id: '418'
author:
- first_name: Felix
  full_name: Pauck, Felix
  id: '22398'
  last_name: Pauck
citation:
  ama: Pauck F. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>.
    Universität Paderborn; 2014.
  apa: Pauck, F. (2014). <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>.
    Universität Paderborn.
  bibtex: '@book{Pauck_2014, title={Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren},
    publisher={Universität Paderborn}, author={Pauck, Felix}, year={2014} }'
  chicago: Pauck, Felix. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>.
    Universität Paderborn, 2014.
  ieee: F. Pauck, <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>.
    Universität Paderborn, 2014.
  mla: Pauck, Felix. <i>Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren</i>.
    Universität Paderborn, 2014.
  short: F. Pauck, Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren,
    Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:30Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: open_access
  content_type: application/pdf
  creator: fpauck
  date_created: 2019-08-07T09:00:20Z
  date_updated: 2019-08-07T09:05:38Z
  file_id: '12906'
  file_name: fpauck_2014.pdf
  file_size: 3191756
  relation: main_file
  title: Bachelorarbeit
file_date_updated: 2019-08-07T09:05:38Z
has_accepted_license: '1'
language:
- iso: ger
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
title: Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren
type: bachelorsthesis
user_id: '22398'
year: '2014'
...
---
_id: '419'
abstract:
- lang: eng
  text: The present thesis investigates the prevalence of and the reasons for hiring
    discrimination against women and ethnic Turks in the German labor market. Subsequent
    to a discussion of how to reveal discrimination, the literature on wage and employment
    differences inside and outside the German labor market is reviewed. Afterwards,
    different (economic) theories explaining inequalities in labor markets are presented.
    In the empirical analyses a field experiment - the so called correspondence testing
    - is conducted where matched pairs of (fictitious) male and female as well as
    German-named and Turkish-named applicants respond to, respectively, 656 and 608
    (real) apprenticeship offers in predominantly male-dominated jobs. Descriptive
    results and econometric analyses using probit regressions on various model specifications
    indicate that the female applicant has a 19 percent lower callback probability
    compared to her male counterpart. However, differential treatment is both job-
    and firm-type driven. While callback rates are not statistically different from
    zero in female-dominated and “gender-neutral” occupations, they prevail in jobs
    where men are overrepresented. Furthermore, discrimination is restricted to late
    recruiters, i.e., companies that advertise their vacancies right before the apprenticeship
    is supposed to start. Similar conclusions can be drawn from the study investigating
    ethnic discrimination. The 32 percent lower callback probability of the Turkish-named
    applicant decreases if early rather than late recruiters are addressed. Apart
    from that, comparing response and callback rates to the candidates using different
    experimental designs, i.e., sending out single versus pairs of applications, yields
    no statistically significant differences demonstrating the unbiasedness of the
    correspondence approach.
author:
- first_name: Andre
  full_name: Kolle, Andre
  last_name: Kolle
citation:
  ama: 'Kolle A. <i>Gender and Ethnic Discrimination in Hiring : Evidence from Field
    Experiments in the German Labor Market</i>. Universität Paderborn; 2014.'
  apa: 'Kolle, A. (2014). <i>Gender and ethnic discrimination in hiring : evidence
    from field experiments in the German labor market</i>. Universität Paderborn.'
  bibtex: '@book{Kolle_2014, title={Gender and ethnic discrimination in hiring : evidence
    from field experiments in the German labor market}, publisher={Universität Paderborn},
    author={Kolle, Andre}, year={2014} }'
  chicago: 'Kolle, Andre. <i>Gender and Ethnic Discrimination in Hiring : Evidence
    from Field Experiments in the German Labor Market</i>. Universität Paderborn,
    2014.'
  ieee: 'A. Kolle, <i>Gender and ethnic discrimination in hiring : evidence from field
    experiments in the German labor market</i>. Universität Paderborn, 2014.'
  mla: 'Kolle, Andre. <i>Gender and Ethnic Discrimination in Hiring : Evidence from
    Field Experiments in the German Labor Market</i>. Universität Paderborn, 2014.'
  short: 'A. Kolle, Gender and Ethnic Discrimination in Hiring : Evidence from Field
    Experiments in the German Labor Market, Universität Paderborn, 2014.'
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:32Z
ddc:
- '040'
department:
- _id: '19'
- _id: '183'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:33:05Z
  date_updated: 2018-03-16T11:33:05Z
  file_id: '1359'
  file_name: 419-Dissertation_Veroeffentlichung_Andre_Kolle_30032014.pdf
  file_size: 3036379
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:33:05Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
title: 'Gender and ethnic discrimination in hiring : evidence from field experiments
  in the German labor market'
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '420'
author:
- first_name: Sven
  full_name: Merschjohann, Sven
  last_name: Merschjohann
citation:
  ama: Merschjohann S. <i>Fuzzy Matching of Service Price Specifications</i>. Universität
    Paderborn; 2014.
  apa: Merschjohann, S. (2014). <i>Fuzzy Matching of Service Price Specifications</i>.
    Universität Paderborn.
  bibtex: '@book{Merschjohann_2014, title={Fuzzy Matching of Service Price Specifications},
    publisher={Universität Paderborn}, author={Merschjohann, Sven}, year={2014} }'
  chicago: Merschjohann, Sven. <i>Fuzzy Matching of Service Price Specifications</i>.
    Universität Paderborn, 2014.
  ieee: S. Merschjohann, <i>Fuzzy Matching of Service Price Specifications</i>. Universität
    Paderborn, 2014.
  mla: Merschjohann, Sven. <i>Fuzzy Matching of Service Price Specifications</i>.
    Universität Paderborn, 2014.
  short: S. Merschjohann, Fuzzy Matching of Service Price Specifications, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:33Z
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Fuzzy Matching of Service Price Specifications
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '421'
author:
- first_name: Jan
  full_name: Lippert, Jan
  last_name: Lippert
citation:
  ama: Lippert J. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn; 2014.
  apa: Lippert, J. (2014). <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn.
  bibtex: '@book{Lippert_2014, title={Fujisaki-Okamoto Transformation}, publisher={Universität
    Paderborn}, author={Lippert, Jan}, year={2014} }'
  chicago: Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn,
    2014.
  ieee: J. Lippert, <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn,
    2014.
  mla: Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn,
    2014.
  short: J. Lippert, Fujisaki-Okamoto Transformation, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:36Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Fujisaki-Okamoto Transformation
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '422'
author:
- first_name: Maryam
  full_name: Sanati, Maryam
  last_name: Sanati
citation:
  ama: Sanati M. <i>Formal Semantics of Probabilistic SMT Solving in Verification
    of Service Compositions</i>. Universität Paderborn; 2014.
  apa: Sanati, M. (2014). <i>Formal Semantics of Probabilistic SMT Solving in Verification
    of Service Compositions</i>. Universität Paderborn.
  bibtex: '@book{Sanati_2014, title={Formal Semantics of Probabilistic SMT Solving
    in Verification of Service Compositions}, publisher={Universität Paderborn}, author={Sanati,
    Maryam}, year={2014} }'
  chicago: Sanati, Maryam. <i>Formal Semantics of Probabilistic SMT Solving in Verification
    of Service Compositions</i>. Universität Paderborn, 2014.
  ieee: M. Sanati, <i>Formal Semantics of Probabilistic SMT Solving in Verification
    of Service Compositions</i>. Universität Paderborn, 2014.
  mla: Sanati, Maryam. <i>Formal Semantics of Probabilistic SMT Solving in Verification
    of Service Compositions</i>. Universität Paderborn, 2014.
  short: M. Sanati, Formal Semantics of Probabilistic SMT Solving in Verification
    of Service Compositions, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:38Z
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Formal Semantics of Probabilistic SMT Solving in Verification of Service Compositions
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '423'
author:
- first_name: Suman
  full_name: Jojiju, Suman
  last_name: Jojiju
citation:
  ama: Jojiju S. <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>.
    Universität Paderborn; 2014.
  apa: Jojiju, S. (2014). <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>.
    Universität Paderborn.
  bibtex: '@book{Jojiju_2014, title={Finding Optimal Self-Adaption Rules by Design-Space
    Exploration}, publisher={Universität Paderborn}, author={Jojiju, Suman}, year={2014}
    }'
  chicago: Jojiju, Suman. <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>.
    Universität Paderborn, 2014.
  ieee: S. Jojiju, <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>.
    Universität Paderborn, 2014.
  mla: Jojiju, Suman. <i>Finding Optimal Self-Adaption Rules by Design-Space Exploration</i>.
    Universität Paderborn, 2014.
  short: S. Jojiju, Finding Optimal Self-Adaption Rules by Design-Space Exploration,
    Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:40Z
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Finding Optimal Self-Adaption Rules by Design-Space Exploration
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '424'
author:
- first_name: Christoph
  full_name: Finkensiep, Christoph
  last_name: Finkensiep
citation:
  ama: Finkensiep C. <i>Fast and Flexible Automatic Composition of Semantic Web Services</i>.
    Universität Paderborn; 2014.
  apa: Finkensiep, C. (2014). <i>Fast and Flexible Automatic Composition of Semantic
    Web Services</i>. Universität Paderborn.
  bibtex: '@book{Finkensiep_2014, title={Fast and Flexible Automatic Composition of
    Semantic Web Services}, publisher={Universität Paderborn}, author={Finkensiep,
    Christoph}, year={2014} }'
  chicago: Finkensiep, Christoph. <i>Fast and Flexible Automatic Composition of Semantic
    Web Services</i>. Universität Paderborn, 2014.
  ieee: C. Finkensiep, <i>Fast and Flexible Automatic Composition of Semantic Web
    Services</i>. Universität Paderborn, 2014.
  mla: Finkensiep, Christoph. <i>Fast and Flexible Automatic Composition of Semantic
    Web Services</i>. Universität Paderborn, 2014.
  short: C. Finkensiep, Fast and Flexible Automatic Composition of Semantic Web Services,
    Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:40Z
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Fast and Flexible Automatic Composition of Semantic Web Services
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '425'
abstract:
- lang: eng
  text: In this paper, we evaluate the robustness of our color-based segmentation
    approach in combination with different color spaces, namely RGB, L*a*b*, HSV,
    and log-chromaticity (LCCS). For this purpose, we describe our deterministic segmentation
    algorithm including its gradually transformation of pixel-precise image data into
    a less error-prone and therefore more robust statistical representation in terms
    of moments. To investigate the robustness of a specific segmentation setting,
    we introduce our evaluation framework that directly works on the statistical representation.
    It is based on two different types of robustness measures, namely relative and
    absolute robustness. While relative robustness measures stability of segmentation
    results over time, absolute robustness measures stability regarding varying illumination
    by comparing results with ground truth data. The significance of these robustness
    measures is shown by evaluating our segmentation approach with different color
    spaces. For the evaluation process, an artificial scene was chosen as representative
    for application scenarios based on artificial landmarks.
author:
- first_name: Alexander
  full_name: Jungmann, Alexander
  last_name: Jungmann
- first_name: Jan
  full_name: Jatzkowski, Jan
  last_name: Jatzkowski
- first_name: Bernd
  full_name: Kleinjohann, Bernd
  last_name: Kleinjohann
citation:
  ama: 'Jungmann A, Jatzkowski J, Kleinjohann B. Evaluation of Color Spaces for Robust
    Image Segmentation. In: <i>Proceedings of the 9th International Conference on
    Computer Vision Theory and Applications (VISAPP)</i>. ; 2014:648-655.'
  apa: Jungmann, A., Jatzkowski, J., &#38; Kleinjohann, B. (2014). Evaluation of Color
    Spaces for Robust Image Segmentation. In <i>Proceedings of the 9th International
    Conference on Computer Vision Theory and Applications (VISAPP)</i> (pp. 648–655).
  bibtex: '@inproceedings{Jungmann_Jatzkowski_Kleinjohann_2014, title={Evaluation
    of Color Spaces for Robust Image Segmentation}, booktitle={Proceedings of the
    9th International Conference on Computer Vision Theory and Applications (VISAPP)},
    author={Jungmann, Alexander and Jatzkowski, Jan and Kleinjohann, Bernd}, year={2014},
    pages={648–655} }'
  chicago: Jungmann, Alexander, Jan Jatzkowski, and Bernd Kleinjohann. “Evaluation
    of Color Spaces for Robust Image Segmentation.” In <i>Proceedings of the 9th International
    Conference on Computer Vision Theory and Applications (VISAPP)</i>, 648–55, 2014.
  ieee: A. Jungmann, J. Jatzkowski, and B. Kleinjohann, “Evaluation of Color Spaces
    for Robust Image Segmentation,” in <i>Proceedings of the 9th International Conference
    on Computer Vision Theory and Applications (VISAPP)</i>, 2014, pp. 648–655.
  mla: Jungmann, Alexander, et al. “Evaluation of Color Spaces for Robust Image Segmentation.”
    <i>Proceedings of the 9th International Conference on Computer Vision Theory and
    Applications (VISAPP)</i>, 2014, pp. 648–55.
  short: 'A. Jungmann, J. Jatzkowski, B. Kleinjohann, in: Proceedings of the 9th International
    Conference on Computer Vision Theory and Applications (VISAPP), 2014, pp. 648–655.'
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:42Z
ddc:
- '040'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:32:35Z
  date_updated: 2018-03-16T11:32:35Z
  file_id: '1358'
  file_name: 425-visapp2014-camera-ready.pdf
  file_size: 6355291
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:32:35Z
has_accepted_license: '1'
page: 648-655
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 9th International Conference on Computer Vision Theory
  and Applications (VISAPP)
status: public
title: Evaluation of Color Spaces for Robust Image Segmentation
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '426'
author:
- first_name: Veit
  full_name: Dornseifer, Veit
  last_name: Dornseifer
citation:
  ama: Dornseifer V. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
    Network</i>. Universität Paderborn; 2014.
  apa: Dornseifer, V. (2014). <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data
    Center Network</i>. Universität Paderborn.
  bibtex: '@book{Dornseifer_2014, title={Evaluation of a Hybrid Packet-/Circuit-Switched
    Data Center Network}, publisher={Universität Paderborn}, author={Dornseifer, Veit},
    year={2014} }'
  chicago: Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data
    Center Network</i>. Universität Paderborn, 2014.
  ieee: V. Dornseifer, <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
    Network</i>. Universität Paderborn, 2014.
  mla: Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
    Network</i>. Universität Paderborn, 2014.
  short: V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
    Network, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:43Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '427'
author:
- first_name: Benjamin
  full_name: Bulk, Benjamin
  last_name: Bulk
citation:
  ama: Bulk B. <i>Evaluating the Influence of Different Abstraction Levels of Software
    Design on Performance Prediction</i>. Universität Paderborn; 2014.
  apa: Bulk, B. (2014). <i>Evaluating the Influence of Different Abstraction Levels
    of Software Design on Performance prediction</i>. Universität Paderborn.
  bibtex: '@book{Bulk_2014, title={Evaluating the Influence of Different Abstraction
    Levels of Software Design on Performance prediction}, publisher={Universität Paderborn},
    author={Bulk, Benjamin}, year={2014} }'
  chicago: Bulk, Benjamin. <i>Evaluating the Influence of Different Abstraction Levels
    of Software Design on Performance Prediction</i>. Universität Paderborn, 2014.
  ieee: B. Bulk, <i>Evaluating the Influence of Different Abstraction Levels of Software
    Design on Performance prediction</i>. Universität Paderborn, 2014.
  mla: Bulk, Benjamin. <i>Evaluating the Influence of Different Abstraction Levels
    of Software Design on Performance Prediction</i>. Universität Paderborn, 2014.
  short: B. Bulk, Evaluating the Influence of Different Abstraction Levels of Software
    Design on Performance Prediction, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:45Z
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Evaluating the Influence of Different Abstraction Levels of Software Design
  on Performance prediction
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '428'
abstract:
- lang: eng
  text: Services are self-contained software components that can be used platform
    independent and that aim at maximizing software reuse. A basic concern in service
    oriented architectures is to measure the reusability of services. One of the most
    important qualities is the functional reusability, which indicates how relevant
    the task is that a service solves. Current metrics for functional reusability
    of software, however, either require source code analysis or have very little
    explanatory power. This paper gives a formally described vision statement for
    the estimation of functional reusability of services and sketches an exemplary
    reusability metric that is based on the service descriptions.
author:
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
citation:
  ama: 'Mohr F. Estimating Functional Reusability of Services. In: <i>Proceedings
    of the 12th International Conference on Service Oriented Computing (ICSOC)</i>.
    LNCS. ; 2014:411-418.'
  apa: Mohr, F. (2014). Estimating Functional Reusability of Services. In <i>Proceedings
    of the 12th International Conference on Service Oriented Computing (ICSOC)</i>
    (pp. 411–418).
  bibtex: '@inproceedings{Mohr_2014, series={LNCS}, title={Estimating Functional Reusability
    of Services}, booktitle={Proceedings of the 12th International Conference on Service
    Oriented Computing (ICSOC)}, author={Mohr, Felix}, year={2014}, pages={411–418},
    collection={LNCS} }'
  chicago: Mohr, Felix. “Estimating Functional Reusability of Services.” In <i>Proceedings
    of the 12th International Conference on Service Oriented Computing (ICSOC)</i>,
    411–18. LNCS, 2014.
  ieee: F. Mohr, “Estimating Functional Reusability of Services,” in <i>Proceedings
    of the 12th International Conference on Service Oriented Computing (ICSOC)</i>,
    2014, pp. 411–418.
  mla: Mohr, Felix. “Estimating Functional Reusability of Services.” <i>Proceedings
    of the 12th International Conference on Service Oriented Computing (ICSOC)</i>,
    2014, pp. 411–18.
  short: 'F. Mohr, in: Proceedings of the 12th International Conference on Service
    Oriented Computing (ICSOC), 2014, pp. 411–418.'
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:47Z
ddc:
- '040'
department:
- _id: '355'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:32:02Z
  date_updated: 2018-03-16T11:32:02Z
  file_id: '1357'
  file_name: 428-ICSOC14.pdf
  file_size: 200063
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:32:02Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007%2F978-3-662-45391-9_31
page: 411-418
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 12th International Conference on Service Oriented
  Computing (ICSOC)
series_title: LNCS
status: public
title: Estimating Functional Reusability of Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '429'
author:
- first_name: Maik
  full_name: Herbort, Maik
  last_name: Herbort
citation:
  ama: Herbort M. <i>Entwicklung eines mathematischen Modells zur Optimierung der
    Struktur eines Trinkwasserbehälters</i>. Universität Paderborn; 2014.
  apa: Herbort, M. (2014). <i>Entwicklung eines mathematischen Modells zur Optimierung
    der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn.
  bibtex: '@book{Herbort_2014, title={Entwicklung eines mathematischen Modells zur
    Optimierung der Struktur eines Trinkwasserbehälters}, publisher={Universität Paderborn},
    author={Herbort, Maik}, year={2014} }'
  chicago: Herbort, Maik. <i>Entwicklung eines mathematischen Modells zur Optimierung
    der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn, 2014.
  ieee: M. Herbort, <i>Entwicklung eines mathematischen Modells zur Optimierung der
    Struktur eines Trinkwasserbehälters</i>. Universität Paderborn, 2014.
  mla: Herbort, Maik. <i>Entwicklung eines mathematischen Modells zur Optimierung
    der Struktur eines Trinkwasserbehälters</i>. Universität Paderborn, 2014.
  short: M. Herbort, Entwicklung eines mathematischen Modells zur Optimierung der
    Struktur eines Trinkwasserbehälters, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:48Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '15'
  name: SFB 901 - Subprojekt C3
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines
  Trinkwasserbehälters
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '430'
author:
- first_name: Andreas
  full_name: Krakau, Andreas
  last_name: Krakau
citation:
  ama: Krakau A. <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten
    Typsystems in SMT</i>. Universität Paderborn; 2014.
  apa: Krakau, A. (2014). <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten
    Typsystems in SMT</i>. Universität Paderborn.
  bibtex: '@book{Krakau_2014, title={Entwicklung eines Konzepts zur Kodierung eines
    objektorientierten Typsystems in SMT}, publisher={Universität Paderborn}, author={Krakau,
    Andreas}, year={2014} }'
  chicago: Krakau, Andreas. <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten
    Typsystems in SMT</i>. Universität Paderborn, 2014.
  ieee: A. Krakau, <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten
    Typsystems in SMT</i>. Universität Paderborn, 2014.
  mla: Krakau, Andreas. <i>Entwicklung eines Konzepts zur Kodierung eines objektorientierten
    Typsystems in SMT</i>. Universität Paderborn, 2014.
  short: A. Krakau, Entwicklung eines Konzepts zur Kodierung eines objektorientierten
    Typsystems in SMT, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:50Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Entwicklung eines Konzepts zur Kodierung eines objektorientierten Typsystems
  in SMT
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '431'
abstract:
- lang: eng
  text: In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse
    energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling
    Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW!
    und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren
    zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen
    solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren.
    Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor
    der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht
    abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch
    des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$
    modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine
    Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling
    Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden
    und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel
    3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems.
    Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige
    Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar
    guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen
    bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren
    Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine
    Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs
    betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen
    Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage
    entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.-
    Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht
    direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein
    allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen
    eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t
    des Problems und entwerfe verschiedene Approximationsalgorithmen.
author:
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
citation:
  ama: Kling P. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn;
    2014.
  apa: Kling, P. (2014). <i>Energy-efficient Scheduling Algorithms</i>. Universität
    Paderborn.
  bibtex: '@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität
    Paderborn}, author={Kling, Peter}, year={2014} }'
  chicago: Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität
    Paderborn, 2014.
  ieee: P. Kling, <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn,
    2014.
  mla: Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn,
    2014.
  short: P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn,
    2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:52Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:31:29Z
  date_updated: 2018-03-16T11:31:29Z
  file_id: '1356'
  file_name: 431-Peter_Kling_PhDThesis_01.pdf
  file_size: 792106
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:31:29Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Energy-efficient Scheduling Algorithms
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '432'
author:
- first_name: Nico
  full_name: Bredenbals, Nico
  last_name: Bredenbals
citation:
  ama: Bredenbals N. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität
    Paderborn; 2014.
  apa: Bredenbals, N. (2014). <i>Energy-Efficient Queuing with Delayed Deactivation</i>.
    Universität Paderborn.
  bibtex: '@book{Bredenbals_2014, title={Energy-Efficient Queuing with Delayed Deactivation},
    publisher={Universität Paderborn}, author={Bredenbals, Nico}, year={2014} }'
  chicago: Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>.
    Universität Paderborn, 2014.
  ieee: N. Bredenbals, <i>Energy-Efficient Queuing with Delayed Deactivation</i>.
    Universität Paderborn, 2014.
  mla: Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>.
    Universität Paderborn, 2014.
  short: N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:54Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Energy-Efficient Queuing with Delayed Deactivation
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '433'
abstract:
- lang: eng
  text: Virtual FPGAs are overlay architectures realized on top of physical FPGAs.
    They are proposed to enhance or abstract away from the physical FPGA for experimenting
    with novel architectures and design tool flows. In this paper, we present an embedding
    of a ZUMA-based virtual FPGA fabric into a complete configurable system-on-chip.
    Such an embedding is required to fully harness the potential of virtual FPGAs,
    in particular to give the virtual circuits access to main memory and operating
    system services, and to enable a concurrent operation of virtualized and non-virtualized
    circuitry. We discuss our extension to ZUMA and its embedding into the ReconOS
    operating system for hardware/software systems. Furthermore, we present an open
    source tool flow to synthesize configurations for the virtual FPGA.
author:
- first_name: Tobias
  full_name: Wiersema, Tobias
  id: '3118'
  last_name: Wiersema
- first_name: Arne
  full_name: Bockhorn, Arne
  last_name: Bockhorn
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Wiersema T, Bockhorn A, Platzner M. Embedding FPGA Overlays into Configurable
    Systems-on-Chip: ReconOS meets ZUMA. In: <i>Proceedings of the International Conference
    on ReConFigurable Computing and FPGAs (ReConFig)</i>. ; 2014:1-6. doi:<a href="https://doi.org/10.1109/ReConFig.2014.7032514">10.1109/ReConFig.2014.7032514</a>'
  apa: 'Wiersema, T., Bockhorn, A., &#38; Platzner, M. (2014). Embedding FPGA Overlays
    into Configurable Systems-on-Chip: ReconOS meets ZUMA. In <i>Proceedings of the
    International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>
    (pp. 1–6). <a href="https://doi.org/10.1109/ReConFig.2014.7032514">https://doi.org/10.1109/ReConFig.2014.7032514</a>'
  bibtex: '@inproceedings{Wiersema_Bockhorn_Platzner_2014, title={Embedding FPGA Overlays
    into Configurable Systems-on-Chip: ReconOS meets ZUMA}, DOI={<a href="https://doi.org/10.1109/ReConFig.2014.7032514">10.1109/ReConFig.2014.7032514</a>},
    booktitle={Proceedings of the International Conference on ReConFigurable Computing
    and FPGAs (ReConFig)}, author={Wiersema, Tobias and Bockhorn, Arne and Platzner,
    Marco}, year={2014}, pages={1–6} }'
  chicago: 'Wiersema, Tobias, Arne Bockhorn, and Marco Platzner. “Embedding FPGA Overlays
    into Configurable Systems-on-Chip: ReconOS Meets ZUMA.” In <i>Proceedings of the
    International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>,
    1–6, 2014. <a href="https://doi.org/10.1109/ReConFig.2014.7032514">https://doi.org/10.1109/ReConFig.2014.7032514</a>.'
  ieee: 'T. Wiersema, A. Bockhorn, and M. Platzner, “Embedding FPGA Overlays into
    Configurable Systems-on-Chip: ReconOS meets ZUMA,” in <i>Proceedings of the International
    Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–6.'
  mla: 'Wiersema, Tobias, et al. “Embedding FPGA Overlays into Configurable Systems-on-Chip:
    ReconOS Meets ZUMA.” <i>Proceedings of the International Conference on ReConFigurable
    Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–6, doi:<a href="https://doi.org/10.1109/ReConFig.2014.7032514">10.1109/ReConFig.2014.7032514</a>.'
  short: 'T. Wiersema, A. Bockhorn, M. Platzner, in: Proceedings of the International
    Conference on ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–6.'
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:56Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/ReConFig.2014.7032514
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:30:58Z
  date_updated: 2018-03-16T11:30:58Z
  file_id: '1355'
  file_name: 433-wiersema14_reconfig_IEEE_approved.pdf
  file_size: 369333
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:30:58Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-6 '
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the International Conference on ReConFigurable Computing
  and FPGAs (ReConFig)
status: public
title: 'Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA'
type: conference
user_id: '477'
year: '2014'
...
---
_id: '434'
author:
- first_name: Linghui
  full_name: Luo, Linghui
  last_name: Luo
citation:
  ama: Luo L. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
    in Skip+ Graphen</i>. Universität Paderborn; 2014.
  apa: Luo, L. (2014). <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep
    Problem in Skip+ Graphen</i>. Universität Paderborn.
  bibtex: '@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das
    Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo,
    Linghui}, year={2014} }'
  chicago: Luo, Linghui. <i>Ein selbst-stabilisierender Algorithmus für das Finite
    Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.
  ieee: L. Luo, <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
    in Skip+ Graphen</i>. Universität Paderborn, 2014.
  mla: Luo, Linghui. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep
    Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.
  short: L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
    in Skip+ Graphen, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:57Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+
  Graphen
type: bachelorsthesis
user_id: '477'
year: '2014'
...