---
_id: '421'
author:
- first_name: Jan
full_name: Lippert, Jan
last_name: Lippert
citation:
ama: Lippert J. Fujisaki-Okamoto Transformation. Universität Paderborn; 2014.
apa: Lippert, J. (2014). Fujisaki-Okamoto Transformation. Universität Paderborn.
bibtex: '@book{Lippert_2014, title={Fujisaki-Okamoto Transformation}, publisher={Universität
Paderborn}, author={Lippert, Jan}, year={2014} }'
chicago: Lippert, Jan. Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
ieee: J. Lippert, Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
mla: Lippert, Jan. Fujisaki-Okamoto Transformation. 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. Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn; 2014.
apa: Sanati, M. (2014). Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. 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. Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn, 2014.
ieee: M. Sanati, Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. Universität Paderborn, 2014.
mla: Sanati, Maryam. Formal Semantics of Probabilistic SMT Solving in Verification
of Service Compositions. 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. Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn; 2014.
apa: Jojiju, S. (2014). Finding Optimal Self-Adaption Rules by Design-Space Exploration.
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. Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn, 2014.
ieee: S. Jojiju, Finding Optimal Self-Adaption Rules by Design-Space Exploration.
Universität Paderborn, 2014.
mla: Jojiju, Suman. Finding Optimal Self-Adaption Rules by Design-Space Exploration.
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. Fast and Flexible Automatic Composition of Semantic Web Services.
Universität Paderborn; 2014.
apa: Finkensiep, C. (2014). Fast and Flexible Automatic Composition of Semantic
Web Services. 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. Fast and Flexible Automatic Composition of Semantic
Web Services. Universität Paderborn, 2014.
ieee: C. Finkensiep, Fast and Flexible Automatic Composition of Semantic Web
Services. Universität Paderborn, 2014.
mla: Finkensiep, Christoph. Fast and Flexible Automatic Composition of Semantic
Web Services. 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: Proceedings of the 9th International Conference on
Computer Vision Theory and Applications (VISAPP). ; 2014:648-655.'
apa: Jungmann, A., Jatzkowski, J., & Kleinjohann, B. (2014). Evaluation of Color
Spaces for Robust Image Segmentation. In Proceedings of the 9th International
Conference on Computer Vision Theory and Applications (VISAPP) (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 Proceedings of the 9th International
Conference on Computer Vision Theory and Applications (VISAPP), 648–55, 2014.
ieee: A. Jungmann, J. Jatzkowski, and B. Kleinjohann, “Evaluation of Color Spaces
for Robust Image Segmentation,” in Proceedings of the 9th International Conference
on Computer Vision Theory and Applications (VISAPP), 2014, pp. 648–655.
mla: Jungmann, Alexander, et al. “Evaluation of Color Spaces for Robust Image Segmentation.”
Proceedings of the 9th International Conference on Computer Vision Theory and
Applications (VISAPP), 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. Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
Network. Universität Paderborn; 2014.
apa: Dornseifer, V. (2014). Evaluation of a Hybrid Packet-/Circuit-Switched Data
Center Network. 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. Evaluation of a Hybrid Packet-/Circuit-Switched Data
Center Network. Universität Paderborn, 2014.
ieee: V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
Network. Universität Paderborn, 2014.
mla: Dornseifer, Veit. Evaluation of a Hybrid Packet-/Circuit-Switched Data Center
Network. 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. Evaluating the Influence of Different Abstraction Levels of Software
Design on Performance Prediction. Universität Paderborn; 2014.
apa: Bulk, B. (2014). Evaluating the Influence of Different Abstraction Levels
of Software Design on Performance prediction. 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. Evaluating the Influence of Different Abstraction Levels
of Software Design on Performance Prediction. Universität Paderborn, 2014.
ieee: B. Bulk, Evaluating the Influence of Different Abstraction Levels of Software
Design on Performance prediction. Universität Paderborn, 2014.
mla: Bulk, Benjamin. Evaluating the Influence of Different Abstraction Levels
of Software Design on Performance Prediction. 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: Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC).
LNCS. ; 2014:411-418.'
apa: Mohr, F. (2014). Estimating Functional Reusability of Services. In Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC)
(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 Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC),
411–18. LNCS, 2014.
ieee: F. Mohr, “Estimating Functional Reusability of Services,” in Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC),
2014, pp. 411–418.
mla: Mohr, Felix. “Estimating Functional Reusability of Services.” Proceedings
of the 12th International Conference on Service Oriented Computing (ICSOC),
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. Entwicklung eines mathematischen Modells zur Optimierung der
Struktur eines Trinkwasserbehälters. Universität Paderborn; 2014.
apa: Herbort, M. (2014). Entwicklung eines mathematischen Modells zur Optimierung
der Struktur eines Trinkwasserbehälters. 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. Entwicklung eines mathematischen Modells zur Optimierung
der Struktur eines Trinkwasserbehälters. Universität Paderborn, 2014.
ieee: M. Herbort, Entwicklung eines mathematischen Modells zur Optimierung der
Struktur eines Trinkwasserbehälters. Universität Paderborn, 2014.
mla: Herbort, Maik. Entwicklung eines mathematischen Modells zur Optimierung
der Struktur eines Trinkwasserbehälters. 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. Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn; 2014.
apa: Krakau, A. (2014). Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. 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. Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn, 2014.
ieee: A. Krakau, Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. Universität Paderborn, 2014.
mla: Krakau, Andreas. Entwicklung eines Konzepts zur Kodierung eines objektorientierten
Typsystems in SMT. 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. Energy-Efficient Scheduling Algorithms. Universität Paderborn;
2014.
apa: Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität
Paderborn.
bibtex: '@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität
Paderborn}, author={Kling, Peter}, year={2014} }'
chicago: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität
Paderborn, 2014.
ieee: P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn,
2014.
mla: Kling, Peter. Energy-Efficient Scheduling Algorithms. 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: '4315'
abstract:
- lang: eng
text: 'We simulate numerically light scattering by random irregular particles of
two classes of shape: Gaussian random field particles and agglomerated debri particles.
Comparison of the angular dependencies of the scattering matrix elements for the
case of non-absorbing material shows qualitative similarity of optical properties
of both types despite different morphology of scatterers. Absorbing particles
result in the difference in linear polarization. However, a strong similarty remains
for the intensity curves.'
author:
- first_name: Yevgen
full_name: Grynko, Yevgen
id: '26059'
last_name: Grynko
- first_name: Evgenij
full_name: Zubko, Evgenij
last_name: Zubko
citation:
ama: 'Grynko Y, Zubko E. Light Scattering By Random Irregular Particles With Different
Morphology. In: ; 2014.'
apa: Grynko, Y., & Zubko, E. (2014). Light Scattering By Random Irregular Particles
With Different Morphology. Presented at the 10th International Conference on Laser-Light
and Interactions with Particles, Marseille (France).
bibtex: '@inproceedings{Grynko_Zubko_2014, title={Light Scattering By Random Irregular
Particles With Different Morphology}, author={Grynko, Yevgen and Zubko, Evgenij},
year={2014} }'
chicago: Grynko, Yevgen, and Evgenij Zubko. “Light Scattering By Random Irregular
Particles With Different Morphology,” 2014.
ieee: Y. Grynko and E. Zubko, “Light Scattering By Random Irregular Particles With
Different Morphology,” presented at the 10th International Conference on Laser-Light
and Interactions with Particles, Marseille (France), 2014.
mla: Grynko, Yevgen, and Evgenij Zubko. Light Scattering By Random Irregular
Particles With Different Morphology. 2014.
short: 'Y. Grynko, E. Zubko, in: 2014.'
conference:
end_date: 2014-08-29
location: Marseille (France)
name: 10th International Conference on Laser-Light and Interactions with Particles
start_date: 2014-08-25
date_created: 2018-08-30T09:29:24Z
date_updated: 2022-01-06T07:00:53Z
ddc:
- '530'
department:
- _id: '61'
file:
- access_level: closed
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-30T09:28:00Z
date_updated: 2018-08-30T09:28:00Z
file_id: '4316'
file_name: 2014-08 Grynko,Zubko_Light Scattering by Radndom irregular particles
with different morphology.pdf
file_size: 794798
relation: main_file
success: 1
file_date_updated: 2018-08-30T09:28:00Z
has_accepted_license: '1'
language:
- iso: eng
publication_status: published
status: public
title: Light Scattering By Random Irregular Particles With Different Morphology
type: conference
user_id: '55706'
year: '2014'
...
---
_id: '432'
author:
- first_name: Nico
full_name: Bredenbals, Nico
last_name: Bredenbals
citation:
ama: Bredenbals N. Energy-Efficient Queuing with Delayed Deactivation. Universität
Paderborn; 2014.
apa: Bredenbals, N. (2014). Energy-Efficient Queuing with Delayed Deactivation.
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. Energy-Efficient Queuing with Delayed Deactivation.
Universität Paderborn, 2014.
ieee: N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation.
Universität Paderborn, 2014.
mla: Bredenbals, Nico. Energy-Efficient Queuing with Delayed Deactivation.
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: Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig). ; 2014:1-6. doi:10.1109/ReConFig.2014.7032514'
apa: 'Wiersema, T., Bockhorn, A., & Platzner, M. (2014). Embedding FPGA Overlays
into Configurable Systems-on-Chip: ReconOS meets ZUMA. In Proceedings of the
International Conference on ReConFigurable Computing and FPGAs (ReConFig)
(pp. 1–6). https://doi.org/10.1109/ReConFig.2014.7032514'
bibtex: '@inproceedings{Wiersema_Bockhorn_Platzner_2014, title={Embedding FPGA Overlays
into Configurable Systems-on-Chip: ReconOS meets ZUMA}, DOI={10.1109/ReConFig.2014.7032514},
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 Proceedings of the
International Conference on ReConFigurable Computing and FPGAs (ReConFig),
1–6, 2014. https://doi.org/10.1109/ReConFig.2014.7032514.'
ieee: 'T. Wiersema, A. Bockhorn, and M. Platzner, “Embedding FPGA Overlays into
Configurable Systems-on-Chip: ReconOS meets ZUMA,” in Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–6.'
mla: 'Wiersema, Tobias, et al. “Embedding FPGA Overlays into Configurable Systems-on-Chip:
ReconOS Meets ZUMA.” Proceedings of the International Conference on ReConFigurable
Computing and FPGAs (ReConFig), 2014, pp. 1–6, doi:10.1109/ReConFig.2014.7032514.'
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: '4335'
abstract:
- lang: eng
text: We explore the impact of ∼500 MHz surface acoustic waves traveling across
a commensurable plasmonic grating coupler. A stroboscopic technique involving
surface acoustic waves synchronized to a modelocked optical source allows to time-resolve
the dynamical impact of the electromechanically induced perturbation. The surface
acoustic wave periodically enhances or decreases the surface ripple of the static
grating. Most remarkably, the dynamic surface deformation deliberately modulates
the coupler’s efficiency by ±2% during the ∼2 ns acoustic cycle.
article_type: original
author:
- first_name: Claudia
full_name: Ruppert, Claudia
last_name: Ruppert
- first_name: Frederike
full_name: Förster, Frederike
last_name: Förster
- first_name: Artur
full_name: Zrenner, Artur
id: '606'
last_name: Zrenner
orcid: 0000-0002-5190-0944
- first_name: Jörg B.
full_name: Kinzel, Jörg B.
last_name: Kinzel
- first_name: Achim
full_name: Wixforth, Achim
last_name: Wixforth
- first_name: Hubert J.
full_name: Krenner, Hubert J.
last_name: Krenner
- first_name: Markus
full_name: Betz, Markus
last_name: Betz
citation:
ama: Ruppert C, Förster F, Zrenner A, et al. Radio Frequency Electromechanical Control
over a Surface Plasmon Polariton Coupler. ACS Photonics. 2014;1(2):91-95.
doi:10.1021/ph400022u
apa: Ruppert, C., Förster, F., Zrenner, A., Kinzel, J. B., Wixforth, A., Krenner,
H. J., & Betz, M. (2014). Radio Frequency Electromechanical Control over a
Surface Plasmon Polariton Coupler. ACS Photonics, 1(2), 91–95. https://doi.org/10.1021/ph400022u
bibtex: '@article{Ruppert_Förster_Zrenner_Kinzel_Wixforth_Krenner_Betz_2014, title={Radio
Frequency Electromechanical Control over a Surface Plasmon Polariton Coupler},
volume={1}, DOI={10.1021/ph400022u},
number={2}, journal={ACS Photonics}, publisher={American Chemical Society (ACS)},
author={Ruppert, Claudia and Förster, Frederike and Zrenner, Artur and Kinzel,
Jörg B. and Wixforth, Achim and Krenner, Hubert J. and Betz, Markus}, year={2014},
pages={91–95} }'
chicago: 'Ruppert, Claudia, Frederike Förster, Artur Zrenner, Jörg B. Kinzel, Achim
Wixforth, Hubert J. Krenner, and Markus Betz. “Radio Frequency Electromechanical
Control over a Surface Plasmon Polariton Coupler.” ACS Photonics 1, no.
2 (2014): 91–95. https://doi.org/10.1021/ph400022u.'
ieee: C. Ruppert et al., “Radio Frequency Electromechanical Control over
a Surface Plasmon Polariton Coupler,” ACS Photonics, vol. 1, no. 2, pp.
91–95, 2014.
mla: Ruppert, Claudia, et al. “Radio Frequency Electromechanical Control over a
Surface Plasmon Polariton Coupler.” ACS Photonics, vol. 1, no. 2, American
Chemical Society (ACS), 2014, pp. 91–95, doi:10.1021/ph400022u.
short: C. Ruppert, F. Förster, A. Zrenner, J.B. Kinzel, A. Wixforth, H.J. Krenner,
M. Betz, ACS Photonics 1 (2014) 91–95.
date_created: 2018-08-30T14:04:23Z
date_updated: 2022-01-06T07:00:56Z
department:
- _id: '15'
- _id: '230'
- _id: '35'
doi: 10.1021/ph400022u
intvolume: ' 1'
issue: '2'
keyword:
- nanomechanics
- plasmonics
- surface acoustic waves
- surface plasmon polaritons
language:
- iso: eng
page: 91-95
publication: ACS Photonics
publication_identifier:
issn:
- 2330-4022
- 2330-4022
publication_status: published
publisher: American Chemical Society (ACS)
status: public
title: Radio Frequency Electromechanical Control over a Surface Plasmon Polariton
Coupler
type: journal_article
user_id: '49428'
volume: 1
year: '2014'
...
---
_id: '434'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
citation:
ama: Luo L. Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn; 2014.
apa: Luo, L. (2014). Ein selbst-stabilisierender Algorithmus für das Finite Sleep
Problem in Skip+ Graphen. 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. Ein selbst-stabilisierender Algorithmus für das Finite
Sleep Problem in Skip+ Graphen. Universität Paderborn, 2014.
ieee: L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn, 2014.
mla: Luo, Linghui. Ein selbst-stabilisierender Algorithmus für das Finite Sleep
Problem in Skip+ Graphen. 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'
...
---
_id: '435'
abstract:
- lang: eng
text: We give a polynomial time algorithm to compute an optimal energy and fractional
weighted flow trade-off schedule for a speed-scalable processor with discrete
speeds.Our algorithm uses a geometric approach that is based on structural properties
obtained from a primal-dual formulation of the problem.
author:
- first_name: Antonios
full_name: Antoniadis, Antonios
last_name: Antoniadis
- first_name: Neal
full_name: Barcelo, Neal
last_name: Barcelo
- first_name: Mario
full_name: Consuegra, Mario
last_name: Consuegra
- first_name: Peer
full_name: Kling, Peer
last_name: Kling
- first_name: Michael
full_name: Nugent, Michael
last_name: Nugent
- first_name: Kirk
full_name: Pruhs, Kirk
last_name: Pruhs
- first_name: Michele
full_name: Scquizzato, Michele
last_name: Scquizzato
citation:
ama: 'Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules. In: Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs.
; 2014:63--74. doi:10.4230/LIPIcs.STACS.2014.63'
apa: Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K.,
& Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules. In Proceedings of the 31st Symposium on
Theoretical Aspects of Computer Science (STACS) (pp. 63--74). https://doi.org/10.4230/LIPIcs.STACS.2014.63
bibtex: '@inproceedings{Antoniadis_Barcelo_Consuegra_Kling_Nugent_Pruhs_Scquizzato_2014,
series={LIPIcs}, title={Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules}, DOI={10.4230/LIPIcs.STACS.2014.63},
booktitle={Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)}, author={Antoniadis, Antonios and Barcelo, Neal and Consuegra,
Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},
year={2014}, pages={63--74}, collection={LIPIcs} }'
chicago: Antoniadis, Antonios, Neal Barcelo, Mario Consuegra, Peer Kling, Michael
Nugent, Kirk Pruhs, and Michele Scquizzato. “Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules.” In Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 63--74.
LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.STACS.2014.63.
ieee: A. Antoniadis et al., “Efficient Computation of Optimal Energy and
Fractional Weighted Flow Trade-off Schedules,” in Proceedings of the 31st Symposium
on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.
mla: Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules.” Proceedings of the 31st Symposium on Theoretical
Aspects of Computer Science (STACS), 2014, pp. 63--74, doi:10.4230/LIPIcs.STACS.2014.63.
short: 'A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs,
M. Scquizzato, in: Proceedings of the 31st Symposium on Theoretical Aspects of
Computer Science (STACS), 2014, pp. 63--74.'
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2014.63
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:30:23Z
date_updated: 2018-03-16T11:30:23Z
file_id: '1354'
file_name: 435-Kling_C2_STACS2014.pdf
file_size: 525851
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:30:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 63--74
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)
series_title: LIPIcs
status: public
title: Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off
Schedules
type: conference
user_id: '477'
year: '2014'
...
---
_id: '436'
author:
- first_name: Marvin
full_name: Damschen, Marvin
last_name: Damschen
citation:
ama: Damschen M. Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores.
Universität Paderborn; 2014.
apa: Damschen, M. (2014). Easy-to-use on-the-fly binary program acceleration
on many-cores. Universität Paderborn.
bibtex: '@book{Damschen_2014, title={Easy-to-use on-the-fly binary program acceleration
on many-cores}, publisher={Universität Paderborn}, author={Damschen, Marvin},
year={2014} }'
chicago: Damschen, Marvin. Easy-to-Use on-the-Fly Binary Program Acceleration
on Many-Cores. Universität Paderborn, 2014.
ieee: M. Damschen, Easy-to-use on-the-fly binary program acceleration on many-cores.
Universität Paderborn, 2014.
mla: Damschen, Marvin. Easy-to-Use on-the-Fly Binary Program Acceleration on
Many-Cores. Universität Paderborn, 2014.
short: M. Damschen, Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:58Z
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
title: Easy-to-use on-the-fly binary program acceleration on many-cores
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '437'
author:
- first_name: Vanessa
full_name: Wemhöner, Vanessa
last_name: Wemhöner
citation:
ama: Wemhöner V. Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel
des Kaffeerösterkartells. Universität Paderborn; 2014.
apa: Wemhöner, V. (2014). Die ökonomischen Auswirkungen der Kronzeugenregelung
am Beispiel des Kaffeerösterkartells. Universität Paderborn.
bibtex: '@book{Wemhöner_2014, title={Die ökonomischen Auswirkungen der Kronzeugenregelung
am Beispiel des Kaffeerösterkartells}, publisher={Universität Paderborn}, author={Wemhöner,
Vanessa}, year={2014} }'
chicago: Wemhöner, Vanessa. Die ökonomischen Auswirkungen der Kronzeugenregelung
am Beispiel des Kaffeerösterkartells. Universität Paderborn, 2014.
ieee: V. Wemhöner, Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel
des Kaffeerösterkartells. Universität Paderborn, 2014.
mla: Wemhöner, Vanessa. Die ökonomischen Auswirkungen der Kronzeugenregelung
am Beispiel des Kaffeerösterkartells. Universität Paderborn, 2014.
short: V. Wemhöner, Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel
des Kaffeerösterkartells, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:17Z
date_updated: 2022-01-06T07:00:59Z
department:
- _id: '280'
language:
- iso: ger
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: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells
type: bachelorsthesis
user_id: '42447'
year: '2014'
...
---
_id: '438'
author:
- first_name: Andreas
full_name: Kokoschka, Andreas
last_name: Kokoschka
citation:
ama: Kokoschka A. Designing an Anonymous and Secure Reputation System Using a
Group Signature Variant. Universität Paderborn; 2014.
apa: Kokoschka, A. (2014). Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn.
bibtex: '@book{Kokoschka_2014, title={Designing an Anonymous and Secure Reputation
System Using a Group Signature Variant}, publisher={Universität Paderborn}, author={Kokoschka,
Andreas}, year={2014} }'
chicago: Kokoschka, Andreas. Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn, 2014.
ieee: A. Kokoschka, Designing an Anonymous and Secure Reputation System Using
a Group Signature Variant. Universität Paderborn, 2014.
mla: Kokoschka, Andreas. Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn, 2014.
short: A. Kokoschka, Designing an Anonymous and Secure Reputation System Using a
Group Signature Variant, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:17Z
date_updated: 2022-01-06T07:01:00Z
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
title: Designing an Anonymous and Secure Reputation System Using a Group Signature
Variant
type: bachelorsthesis
user_id: '15504'
year: '2014'
...