---
_id: '5760'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
citation:
ama: Yigitbas E. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse
in Service-Orientierten Systemen.; 2012.
apa: Yigitbas, E. (2012). Entwicklung eines Monitoring- und Adaptionskonzeptes
für Geschäftsprozesse in service-orientierten Systemen.
bibtex: '@book{Yigitbas_2012, title={Entwicklung eines Monitoring- und Adaptionskonzeptes
für Geschäftsprozesse in service-orientierten Systemen}, author={Yigitbas, Enes},
year={2012} }'
chicago: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes
Für Geschäftsprozesse in Service-Orientierten Systemen, 2012.
ieee: E. Yigitbas, Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse
in service-orientierten Systemen. 2012.
mla: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für
Geschäftsprozesse in Service-Orientierten Systemen. 2012.
short: E. Yigitbas, Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse
in Service-Orientierten Systemen, 2012.
date_created: 2018-11-19T15:29:59Z
date_updated: 2022-01-06T07:02:38Z
department:
- _id: '66'
language:
- iso: eng
status: public
title: Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse
in service-orientierten Systemen
type: mastersthesis
user_id: '8447'
year: '2012'
...
---
_id: '577'
abstract:
- lang: eng
text: 'SSS is an international forum for researchers and practitioners in the design
and development of distributed systems with self-properties: (classical) self-stabilizing,
self-configuring, self-organizing, self-managing, self-repairing, self-healing,
self-optimizing, self-adaptive, and self-protecting. Research in distributed systems
is now at a crucialpoint in its evolution, marked by the importance of dynamic
systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile
ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications
such as grid and web services, banking and e-commerce, e-health and robotics,
aerospace and avionics, automotive, industrial process control, etc. have joined
the traditional applications of distributed systems. The theory of self-stabilization
has been enriched in the last 30 years by high quality research contributions
in the areas of algorithmic techniques, formal methodologies, model theoretic
issues, and composition techniques. All these areas are essential to the understanding
and maintenance of self-properties in fault-tolerant distributed systems.'
citation:
ama: Richa AW, Scheideler C, eds. Stabilization, Safety, and Security of Distributed
Systems.; 2012. doi:10.1007/978-3-642-33536-5
apa: Richa, A. W., & Scheideler, C. (Eds.). (2012). Stabilization, Safety,
and Security of Distributed Systems. Presented at the Stabilization, Safety,
and Security of Distributed Systems (SSS), Paderborn, Germany. https://doi.org/10.1007/978-3-642-33536-5
bibtex: '@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security
of Distributed Systems}, DOI={10.1007/978-3-642-33536-5},
year={2012} }'
chicago: Richa, Andrea W., and Christian Scheideler, eds. Stabilization, Safety,
and Security of Distributed Systems, 2012. https://doi.org/10.1007/978-3-642-33536-5.
ieee: A. W. Richa and C. Scheideler, Eds., Stabilization, Safety, and Security
of Distributed Systems. 2012.
mla: Richa, Andrea W., and Christian Scheideler, editors. Stabilization, Safety,
and Security of Distributed Systems. 2012, doi:10.1007/978-3-642-33536-5.
short: A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed
Systems, 2012.
conference:
end_date: 2012-10-04
location: Paderborn, Germany
name: Stabilization, Safety, and Security of Distributed Systems (SSS)
start_date: 2012-10-01
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:39Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33536-5
editor:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:09:19Z
date_updated: 2018-03-21T13:09:19Z
file_id: '1569'
file_name: 577-SSS2012Richa-Scheideler.pdf
file_size: 169564
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:09:19Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
status: public
title: Stabilization, Safety, and Security of Distributed Systems
type: conference_editor
user_id: '15504'
year: '2012'
...
---
_id: '578'
abstract:
- lang: eng
text: 'This paper analyzes the stability of capital tax harmonization agreements
in a stylized model where countries have formed coalitions which set a common
tax rate in order to avoid the inefficient fully non-cooperative Nash equilibrium.
In particular, for a given coalition structure we study to what extend the stability
of tax agreements is affected by the coalitions that have formed. In our set-up,
countries are symmetric, but coalitions can be of arbitrary size. We analyze stability
by means of a repeated game setting employing simple trigger strategies and we
allow a sub-coalition to deviate from the coalitional equilibrium. For a given
form of punishment we are able to rank the stability of different coalition structures
as long as the size of the largest coalition does not change. Our main results
are: (1) singleton regions have the largest incentives to deviate, (2) the stability
of cooperation depends on the degree of cooperative behavior ex-ante.'
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Sarah
full_name: Brockhoff, Sarah
last_name: Brockhoff
citation:
ama: Brangewitz S, Brockhoff S. Stability of Coalitional Equilibria within Repeated
Tax Competition. Universität Paderborn; 2012.
apa: Brangewitz, S., & Brockhoff, S. (2012). Stability of Coalitional Equilibria
within Repeated Tax Competition. Universität Paderborn.
bibtex: '@book{Brangewitz_Brockhoff_2012, title={Stability of Coalitional Equilibria
within Repeated Tax Competition}, publisher={Universität Paderborn}, author={Brangewitz,
Sonja and Brockhoff, Sarah}, year={2012} }'
chicago: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria
within Repeated Tax Competition. Universität Paderborn, 2012.
ieee: S. Brangewitz and S. Brockhoff, Stability of Coalitional Equilibria within
Repeated Tax Competition. Universität Paderborn, 2012.
mla: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria
within Repeated Tax Competition. Universität Paderborn, 2012.
short: S. Brangewitz, S. Brockhoff, Stability of Coalitional Equilibria within Repeated
Tax Competition, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:08:24Z
date_updated: 2018-03-15T09:08:24Z
file_id: '1267'
file_name: 578-WP48Brangewitz.pdf
file_size: 876927
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:08:24Z
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
title: Stability of Coalitional Equilibria within Repeated Tax Competition
type: report
user_id: '477'
year: '2012'
...
---
_id: '579'
abstract:
- lang: eng
text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number
that is strictly larger than all preceding numbers. In this article we present
a smoothed analysis of the number of left-to-right maxima in the presence of additive
random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are
perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right
maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation
σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis
of the smoothed height of binary search trees and the smoothed number of comparisons
in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε
+ n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our
results can also be applied to bound the smoothed number of points on a convex
hull of points in the two-dimensional plane and to smoothed motion complexity,
a concept we describe in this article. We bound how often one needs to update
a data structure storing the smallest axis-aligned box enclosing a set of points
moving in d-dimensional space.
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Bodo
full_name: Manthey, Bodo
last_name: Manthey
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Till
full_name: Tantau, Till
last_name: Tantau
citation:
ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right
maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174
apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C.,
Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima
with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174
bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012,
title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174},
number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow,
Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald
and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012},
pages={30} }'
chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald
Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis
of Left-to-Right Maxima with Applications.” Transactions on Algorithms,
no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.'
ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with
applications,” Transactions on Algorithms, no. 3, p. 30, 2012.
mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with
Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler,
C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:41Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2229163.2229174
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:04:58Z
date_updated: 2018-03-15T09:04:58Z
file_id: '1266'
file_name: 579-a30-damerow.pdf
file_size: 329282
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:04:58Z
has_accepted_license: '1'
issue: '3'
page: '30'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Smoothed analysis of left-to-right maxima with applications
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '580'
abstract:
- lang: eng
text: We present and study a new model for energy-aware and profit-oriented scheduling
on a single processor.The processor features dynamic speed scaling as well as
suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different
sizes, values, and deadlines.On the arrival of a new job, the scheduler may either
accept or reject the job.Accepted jobs need a certain energy investment to be
finished in time, while rejected jobs cause costs equal to their values.Here,
power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy
investment is power integrated over time.Additionally, the scheduler may decide
to suspend the processor to a sleep mode in which no energy is consumed, though
awaking entails fixed transition costs $\gamma$.The objective is to minimize the
total value of rejected jobs plus the total energy.Our model combines aspects
from advanced energy conservation techniques (namely speed scaling and sleep states)
and profit-oriented scheduling models.We show that \emph{rejection-oblivious}
schedulers (whose rejection decisions are not based on former decisions) have
– in contrast to the model without sleep states – an unbounded competitive ratio.It
turns out that the jobs' value densities (the ratio between a job's value and
its work) are crucial for the performance of such schedulers.We give an algorithm
whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum
value density.If the maximum value density is not too large, the competitiveness
becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict
the value density of low-value jobs only.Using a technique from \cite{Chan:2010}
we transfer our results to processors with a fixed maximum speed.
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Fredrik
full_name: Mallmann Trenn, Fredrik
last_name: Mallmann Trenn
citation:
ama: 'Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down & Sleep for Profit
in Online Deadline Scheduling. In: Even G, Rawitz D, eds. Proceedings of the
1st Mediterranean Conference on Algorithms (MedAlg). LNCS. ; 2012:218-231.
doi:10.1007/978-3-642-34862-4_17'
apa: Cord-Landwehr, A., Kling, P., & Mallmann Trenn, F. (2012). Slow Down &
Sleep for Profit in Online Deadline Scheduling. In G. Even & D. Rawitz (Eds.),
Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)
(pp. 218–231). https://doi.org/10.1007/978-3-642-34862-4_17
bibtex: '@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS},
title={Slow Down & Sleep for Profit in Online Deadline Scheduling}, DOI={10.1007/978-3-642-34862-4_17},
booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)},
author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik},
editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS}
}'
chicago: Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow
Down & Sleep for Profit in Online Deadline Scheduling.” In Proceedings
of the 1st Mediterranean Conference on Algorithms (MedAlg), edited by Guy
Even and Dror Rawitz, 218–31. LNCS, 2012. https://doi.org/10.1007/978-3-642-34862-4_17.
ieee: A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down & Sleep
for Profit in Online Deadline Scheduling,” in Proceedings of the 1st Mediterranean
Conference on Algorithms (MedAlg), 2012, pp. 218–231.
mla: Cord-Landwehr, Andreas, et al. “Slow Down & Sleep for Profit in Online
Deadline Scheduling.” Proceedings of the 1st Mediterranean Conference on Algorithms
(MedAlg), edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:10.1007/978-3-642-34862-4_17.
short: 'A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.),
Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012,
pp. 218–231.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-34862-4_17
editor:
- first_name: Guy
full_name: Even, Guy
last_name: Even
- first_name: Dror
full_name: Rawitz, Dror
last_name: Rawitz
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:03:39Z
date_updated: 2018-03-15T09:03:39Z
file_id: '1265'
file_name: 580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf
file_size: 325939
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:03:39Z
has_accepted_license: '1'
language:
- iso: eng
page: 218-231
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)
series_title: LNCS
status: public
title: Slow Down & Sleep for Profit in Online Deadline Scheduling
type: conference
user_id: '477'
year: '2012'
...
---
_id: '581'
abstract:
- lang: eng
text: 'Nanoparticles are getting more and more in the focus of the scientic community
since the potential for the development of very small particles interacting with
each other and completing medical and other tasks is getting bigger year by year.
In this work we introduce a distributed local algorithm for arranging a set of
nanoparticles on the discrete plane into specic geometric shapes, for instance
a rectangle. The concept of a particle we use can be seen as a simple mobile robot
with the following restrictions: it can only view the state of robots it is physically
connected to, is anonymous, has only a constant size memory, can only move by
using other particles as an anchor point on which it pulls itself alongside, and
it operates in Look-Compute-Move cycles. The main result of this work is the presentation
of a random distributed local algorithm which transforms any given connected set
of particles into a particular geometric shape. As an example we provide a version
of this algorithm for forming a rectangle with an arbitrary predened aspect ratio.
To the best of our knowledge this is the rst work that considers arrangement problems
for these types of robots.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Martina
full_name: 'Hüllmann (married name: Eikel), Martina'
last_name: 'Hüllmann (married name: Eikel)'
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing
Particle Systems. In: Proceedings of the 26th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116'
apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler,
C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE
International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283).
https://doi.org/10.1109/IPDPS.2012.116'
bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012,
title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married
name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012},
pages={1272–1283} }'
chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos,
and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.'
ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler,
“Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.'
mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.
short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler,
in: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2012, pp. 1272–1283.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1109/IPDPS.2012.116
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:39:33Z
date_updated: 2018-03-15T08:39:33Z
file_id: '1263'
file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf
file_size: 373131
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:39:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1272-1283
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Self-Organizing Particle Systems
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '582'
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. Self-Optimizing Binary Search Trees - A Game Theoretic Approach.
Universität Paderborn; 2012.
apa: Strothmann, T. F. (2012). Self-Optimizing Binary Search Trees - A Game Theoretic
Approach. Universität Paderborn.
bibtex: '@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game
Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim
Frederik}, year={2012} }'
chicago: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game
Theoretic Approach. Universität Paderborn, 2012.
ieee: T. F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic
Approach. Universität Paderborn, 2012.
mla: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game
Theoretic Approach. Universität Paderborn, 2012.
short: T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
department:
- _id: '79'
language:
- iso: eng
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: Self-Optimizing Binary Search Trees - A Game Theoretic Approach
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '583'
author:
- first_name: Julian
full_name: Drücker, Julian
last_name: Drücker
citation:
ama: Drücker J. Revenue-Maximizing Order of Sale in Sequential Auctions.
Universität Paderborn; 2012.
apa: Drücker, J. (2012). Revenue-maximizing Order of Sale in Sequential Auctions.
Universität Paderborn.
bibtex: '@book{Drücker_2012, title={Revenue-maximizing Order of Sale in Sequential
Auctions}, publisher={Universität Paderborn}, author={Drücker, Julian}, year={2012}
}'
chicago: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions.
Universität Paderborn, 2012.
ieee: J. Drücker, Revenue-maximizing Order of Sale in Sequential Auctions.
Universität Paderborn, 2012.
mla: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions.
Universität Paderborn, 2012.
short: J. Drücker, Revenue-Maximizing Order of Sale in Sequential Auctions, Universität
Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:43Z
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
title: Revenue-maximizing Order of Sale in Sequential Auctions
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '584'
author:
- first_name: Till
full_name: Hohenberger, Till
last_name: Hohenberger
citation:
ama: Hohenberger T. Queuing Latency at Cooperative Base Stations. Universität
Paderborn; 2012.
apa: Hohenberger, T. (2012). Queuing Latency at Cooperative Base Stations.
Universität Paderborn.
bibtex: '@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations},
publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }'
chicago: Hohenberger, Till. Queuing Latency at Cooperative Base Stations.
Universität Paderborn, 2012.
ieee: T. Hohenberger, Queuing Latency at Cooperative Base Stations. Universität
Paderborn, 2012.
mla: Hohenberger, Till. Queuing Latency at Cooperative Base Stations. Universität
Paderborn, 2012.
short: T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität
Paderborn, 2012.
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02: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: Queuing Latency at Cooperative Base Stations
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '585'
abstract:
- lang: eng
text: In a cloud-computing scenario where users buy software from software providers
and execute it at computing centers, a digital rights management (DRM) system
has to be in place to check the software licenses during each software execution.
However, the exposure of users to privacy invasion in the presence of DRM systems
is problematic.We come up with a concept that unites software providers' and users'
demands for a secure and privacy-preserving DRM system for cloud computing. The
employment of proxy re-encryption allows for a prevention of profile building
(under pseudonym) of users by any party.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: 'Petrlic R. Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM
Scheme. In: Proceedings of 4th International Symposium on Cyberspace Safety
and Security (CSS). LNCS. ; 2012:194-211. doi:10.1007/978-3-642-35362-8_16'
apa: Petrlic, R. (2012). Proxy Re-Encryption in a Privacy-Preserving Cloud Computing
DRM Scheme. In Proceedings of 4th International Symposium on Cyberspace Safety
and Security (CSS) (pp. 194–211). https://doi.org/10.1007/978-3-642-35362-8_16
bibtex: '@inproceedings{Petrlic_2012, series={LNCS}, title={Proxy Re-Encryption
in a Privacy-Preserving Cloud Computing DRM Scheme}, DOI={10.1007/978-3-642-35362-8_16},
booktitle={Proceedings of 4th International Symposium on Cyberspace Safety and
Security (CSS)}, author={Petrlic, Ronald}, year={2012}, pages={194–211}, collection={LNCS}
}'
chicago: Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing
DRM Scheme.” In Proceedings of 4th International Symposium on Cyberspace Safety
and Security (CSS), 194–211. LNCS, 2012. https://doi.org/10.1007/978-3-642-35362-8_16.
ieee: R. Petrlic, “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM
Scheme,” in Proceedings of 4th International Symposium on Cyberspace Safety
and Security (CSS), 2012, pp. 194–211.
mla: Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing
DRM Scheme.” Proceedings of 4th International Symposium on Cyberspace Safety
and Security (CSS), 2012, pp. 194–211, doi:10.1007/978-3-642-35362-8_16.
short: 'R. Petrlic, in: Proceedings of 4th International Symposium on Cyberspace
Safety and Security (CSS), 2012, pp. 194–211.'
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '040'
doi: 10.1007/978-3-642-35362-8_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:38:58Z
date_updated: 2018-03-15T08:38:58Z
file_id: '1262'
file_name: 585-privacy-drm-cloud-1-css-camera-ready.pdf
file_size: 582557
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:38:58Z
has_accepted_license: '1'
page: 194-211
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of 4th International Symposium on Cyberspace Safety and Security
(CSS)
series_title: LNCS
status: public
title: Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '586'
abstract:
- lang: eng
text: FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They
combine the computational power of application specific hardware with software-like
flexibility. At runtime, they can adjust their functionality by downloading new
hardware modules and integrating their functionality. Due to their growing capabilities,
the demands made to reconfigurable hardware grow. Their deployment in increasingly
security critical scenarios requires new ways of enforcing security since a failure
in security has severe consequences. Aside from financial losses, a loss of human
life and risks to national security are possible. With this work I present the
novel and groundbreaking concept of proof-carrying hardware. It is a method for
the verification of properties of hardware modules to guarantee security for a
target platform at runtime. The producer of a hardware module delivers based on
the consumer's safety policy a safety proof in combination with the reconfiguration
bitstream. The extensive computation of a proof is a contrast to the comparatively
undemanding checking of the proof. I present a prototype based on open-source
tools and an abstract FPGA architecture and bitstream format. The proof of the
usability of proof-carrying hardware provides the evaluation of the prototype
with the exemplary application of securing combinational and bounded sequential
equivalence of reference monitor modules for memory safety.
- lang: ger
text: FPGAs, System on Chips und eingebettete Systeme sind heutzutage kaum mehr
wegzudenken. Sie kombinieren die Rechenleistung von spezialisierter Hardware mit
einer Software-ähnlichen Flexibilität. Zur Laufzeit können sie ihre Funktionalität
anpassen, indem sie online neue Hardware Module beziehen und deren Funktionalität
integrieren. Mit der Leistung wachsen auch die Anforderungen an rekonfigurierbare
Hardware. Ihr Einsatz in immer sicherheitskritischeren Szenarien erfordert neue
Wege um Sicherheit zu gewährleisten, da ein Versagen der Sicherheit gravierende
Folgen mit sich bringt. Neben finanziellen Verlusten sind auch der Verlust von
Menschenleben oder Einbußen in der nationalen Sicherheit denkbar. In dieser Arbeit
stelle ich das neue und wegweisende Konzept der beweistragenden Hardware vor.
Es ist eine Methode zur Verifizierung von Eigenschaften von Hardware Modulen um
die Sicherheit der Zielplatformen zur Laufzeit zu garantieren. Der Produzent eines
Hardware Moduls liefert, basierend auf den Sicherheitsbestimmungen des Konsumenten,
einen Beweis der Sicherheit mit dem Rekonfigurierungsbitstrom. Die aufwendige
Berechnung des Beweises steht im Kontrast zu der vergleichsweise unaufwendigen
Überprüfung durch den Konsumenten. Ich präsentiere einen Prototypen basierend
auf Open Source Werkzeugen und einer eigenen abstrakten FPGA Architektur samt
Bitstromformat. Den Nachweis über die Nutzbarkeit von beweistragender Hardware
erbringt die Evaluierung des Prototypen zur beispielhaften Anwendung der Sicherung
von kombinatorischer und begrenzt sequenzieller Äquivalenz von Referenzmonitor-Modulen
zur Speichersicherheit.
author:
- first_name: Stephanie
full_name: Drzevitzky, Stephanie
last_name: Drzevitzky
citation:
ama: 'Drzevitzky S. Proof-Carrying Hardware: A Novel Approach to Reconfigurable
Hardware Security. Universität Paderborn; 2012.'
apa: 'Drzevitzky, S. (2012). Proof-Carrying Hardware: A Novel Approach to Reconfigurable
Hardware Security. Universität Paderborn.'
bibtex: '@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach
to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky,
Stephanie}, year={2012} }'
chicago: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to
Reconfigurable Hardware Security. Universität Paderborn, 2012.'
ieee: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable
Hardware Security. Universität Paderborn, 2012.'
mla: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to Reconfigurable
Hardware Security. Universität Paderborn, 2012.'
short: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable
Hardware Security, Universität Paderborn, 2012.'
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:44Z
ddc:
- '040'
department:
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:38:19Z
date_updated: 2018-03-15T08:38:19Z
file_id: '1261'
file_name: 586-Drzevitzky-PhD_01.pdf
file_size: 1438436
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:38:19Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423
oa: '1'
page: '114'
project:
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication_status: published
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: 'Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security'
type: dissertation
user_id: '477'
year: '2012'
...
---
_id: '587'
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Enno
full_name: Lübbers, Enno
last_name: Lübbers
citation:
ama: Plessl C, Platzner M, Agne A, Happe M, Lübbers E. Programming Models for
Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine; 2012.
apa: Plessl, C., Platzner, M., Agne, A., Happe, M., & Lübbers, E. (2012). Programming
models for reconfigurable heterogeneous multi-cores. Awareness Magazine.
bibtex: '@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models
for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine},
author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus
and Lübbers, Enno}, year={2012} }'
chicago: Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno
Lübbers. Programming Models for Reconfigurable Heterogeneous Multi-Cores.
Awareness Magazine, 2012.
ieee: C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, Programming
models for reconfigurable heterogeneous multi-cores. Awareness Magazine, 2012.
mla: Plessl, Christian, et al. Programming Models for Reconfigurable Heterogeneous
Multi-Cores. Awareness Magazine, 2012.
short: C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models
for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012.
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:44Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:37:02Z
date_updated: 2018-03-15T08:37:02Z
file_id: '1260'
file_name: 587-2012_plessl_awareness_magazine.pdf
file_size: 353057
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:37:02Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Awareness Magazine
status: public
title: Programming models for reconfigurable heterogeneous multi-cores
type: misc
user_id: '398'
year: '2012'
...
---
_id: '588'
abstract:
- lang: eng
text: We come up with a digital rights management (DRM) concept for cloud computing
and show how license management for software within the cloud can be achieved
in a privacy-friendly manner. In our scenario, users who buy software from software
providers stay anonymous. At the same time, our approach guarantees that software
licenses are bound to users and their validity is checked before execution. We
employ a software re-encryption scheme so that computing centers which execute
users’ software are not able to build user profiles—not even under pseudonym—of
their users. We combine secret sharing and homomorphic encryption. We make sure
that malicious users are unable to relay software to others. DRM constitutes an
incentive for software providers to take part in a future cloud computing scenario.We
make this scenario more attractive for users by preserving their privacy.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Petrlic R, Sorge C. Privacy-Preserving DRM for Cloud Computing. In: Proceedings
of the 26th IEEE International Conference on Advanced Information Networking and
Applications (AINA). ; 2012:1286-1291. doi:10.1109/WAINA.2012.92'
apa: Petrlic, R., & Sorge, C. (2012). Privacy-Preserving DRM for Cloud Computing.
In Proceedings of the 26th IEEE International Conference on Advanced Information
Networking and Applications (AINA) (pp. 1286–1291). https://doi.org/10.1109/WAINA.2012.92
bibtex: '@inproceedings{Petrlic_Sorge_2012, title={Privacy-Preserving DRM for Cloud
Computing}, DOI={10.1109/WAINA.2012.92},
booktitle={Proceedings of the 26th IEEE International Conference on Advanced Information
Networking and Applications (AINA)}, author={Petrlic, Ronald and Sorge, Christoph},
year={2012}, pages={1286–1291} }'
chicago: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud
Computing.” In Proceedings of the 26th IEEE International Conference on Advanced
Information Networking and Applications (AINA), 1286–91, 2012. https://doi.org/10.1109/WAINA.2012.92.
ieee: R. Petrlic and C. Sorge, “Privacy-Preserving DRM for Cloud Computing,” in
Proceedings of the 26th IEEE International Conference on Advanced Information
Networking and Applications (AINA), 2012, pp. 1286–1291.
mla: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.”
Proceedings of the 26th IEEE International Conference on Advanced Information
Networking and Applications (AINA), 2012, pp. 1286–91, doi:10.1109/WAINA.2012.92.
short: 'R. Petrlic, C. Sorge, in: Proceedings of the 26th IEEE International Conference
on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291.'
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:45Z
ddc:
- '040'
doi: 10.1109/WAINA.2012.92
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:36:16Z
date_updated: 2018-03-15T08:36:16Z
file_id: '1259'
file_name: 588-drm0-published_01.pdf
file_size: 194323
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:36:16Z
has_accepted_license: '1'
page: 1286-1291
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th IEEE International Conference on Advanced Information
Networking and Applications (AINA)
status: public
title: Privacy-Preserving DRM for Cloud Computing
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '589'
abstract:
- lang: eng
text: We present a privacy-preserving DRM scheme for a (future) cloud computing
software market. In such a market, applications are packed into virtual machines
(VMs) by software providers and the VMs can be executed at any computing center
within the cloud. We propose the introduction of a software TPM as a container
for VM-specific keys within the VM that moves around with the VM within the cloud.
The software TPM is coupled to a virtual TPM at a computing center to constitute
the root of trust for a local DRM enforcement system within the VM that checks
the license before each application execution. This allows flexible price models,
e.g. execute at most n timeslike models. Users have proof that their personally
identifiable information, stored and processed within the VM at a computing center,
cannot be obtained by the computing center. A feature of our solution is that
neither software provider nor computing center are able to build usage profiles
of the software executions.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: 'Petrlic R. Privacy-Preserving Digital Rights Management in a Trusted Cloud
Environment. In: Proceedings of the 11th IEEE International Conference on Trust,
Security and Privacy in Computing and Communications (TrustCom). ; 2012:958-963.
doi:10.1109/TrustCom.2012.225'
apa: Petrlic, R. (2012). Privacy-Preserving Digital Rights Management in a Trusted
Cloud Environment. In Proceedings of the 11th IEEE International Conference
on Trust, Security and Privacy in Computing and Communications (TrustCom)
(pp. 958–963). https://doi.org/10.1109/TrustCom.2012.225
bibtex: '@inproceedings{Petrlic_2012, title={Privacy-Preserving Digital Rights Management
in a Trusted Cloud Environment}, DOI={10.1109/TrustCom.2012.225},
booktitle={Proceedings of the 11th IEEE International Conference on Trust, Security
and Privacy in Computing and Communications (TrustCom)}, author={Petrlic, Ronald},
year={2012}, pages={958–963} }'
chicago: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted
Cloud Environment.” In Proceedings of the 11th IEEE International Conference
on Trust, Security and Privacy in Computing and Communications (TrustCom),
958–63, 2012. https://doi.org/10.1109/TrustCom.2012.225.
ieee: R. Petrlic, “Privacy-Preserving Digital Rights Management in a Trusted Cloud
Environment,” in Proceedings of the 11th IEEE International Conference on Trust,
Security and Privacy in Computing and Communications (TrustCom), 2012, pp.
958–963.
mla: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted
Cloud Environment.” Proceedings of the 11th IEEE International Conference on
Trust, Security and Privacy in Computing and Communications (TrustCom), 2012,
pp. 958–63, doi:10.1109/TrustCom.2012.225.
short: 'R. Petrlic, in: Proceedings of the 11th IEEE International Conference on
Trust, Security and Privacy in Computing and Communications (TrustCom), 2012,
pp. 958–963.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:45Z
ddc:
- '040'
doi: 10.1109/TrustCom.2012.225
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:40:15Z
date_updated: 2018-03-15T08:40:15Z
file_id: '1264'
file_name: 589-published-trustcom.pdf
file_size: 179985
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:40:15Z
has_accepted_license: '1'
language:
- iso: eng
page: 958-963
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 11th IEEE International Conference on Trust, Security
and Privacy in Computing and Communications (TrustCom)
status: public
title: Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment
type: conference
user_id: '477'
year: '2012'
...
---
_id: '590'
abstract:
- lang: eng
text: 'Predicate abstraction is an established technique for reducing the size of
the state space during verification. In this paper, we extend predication abstraction
with block-abstraction memoization (BAM), which exploits the fact that blocks
are often executed several times in a program. The verification can thus benefit
from caching the values of previous block analyses and reusing them upon next
entry into a block. In addition to function bodies, BAM also performs well for
nested loops. To further increase effectiveness, block memoization has been integrated
with lazy abstraction adopting a lazy strategy for cache refinement. Together,
this achieves significant performance increases: our tool (an implementation within
the configurable program analysis framework CPAchecker) has won the Competition
on Software Verification 2012 in the category “Overall”.'
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization.
In: Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM). LNCS. ; 2012:332-347. doi:10.1007/978-3-642-34281-3_24'
apa: Wonisch, D., & Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction
Memoization. In Proceedings of the 14th International Conference on Formal
Engineering Methods (ICFEM) (pp. 332–347). https://doi.org/10.1007/978-3-642-34281-3_24
bibtex: '@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis
with Block-Abstraction Memoization}, DOI={10.1007/978-3-642-34281-3_24},
booktitle={Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347},
collection={LNCS} }'
chicago: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction
Memoization.” In Proceedings of the 14th International Conference on Formal
Engineering Methods (ICFEM), 332–47. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_24.
ieee: D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,”
in Proceedings of the 14th International Conference on Formal Engineering Methods
(ICFEM), 2012, pp. 332–347.
mla: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction
Memoization.” Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM), 2012, pp. 332–47, doi:10.1007/978-3-642-34281-3_24.
short: 'D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference
on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:46Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-34281-3_24
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:33:56Z
date_updated: 2018-03-15T08:33:56Z
file_id: '1258'
file_name: 590-WonischWehrheim2012.pdf
file_size: 320901
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:33:56Z
has_accepted_license: '1'
language:
- iso: eng
page: 332-347
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 14th International Conference on Formal Engineering
Methods (ICFEM)
series_title: LNCS
status: public
title: Predicate Analysis with Block-Abstraction Memoization
type: conference
user_id: '477'
year: '2012'
...
---
_id: '592'
author:
- first_name: Aydin
full_name: Celik, Aydin
last_name: Celik
citation:
ama: 'Celik A. Penny Auctions: Design und Strategisches Verhalten. Universität
Paderborn; 2012.'
apa: 'Celik, A. (2012). Penny Auctions: Design und Strategisches Verhalten.
Universität Paderborn.'
bibtex: '@book{Celik_2012, title={Penny Auctions: Design und Strategisches Verhalten},
publisher={Universität Paderborn}, author={Celik, Aydin}, year={2012} }'
chicago: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten.
Universität Paderborn, 2012.'
ieee: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten. Universität
Paderborn, 2012.'
mla: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten. Universität
Paderborn, 2012.'
short: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten, Universität
Paderborn, 2012.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:47Z
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
title: 'Penny Auctions: Design und Strategisches Verhalten'
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '593'
author:
- first_name: Tobias
full_name: Rojahn, Tobias
last_name: Rojahn
citation:
ama: Rojahn T. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn; 2012.
apa: Rojahn, T. (2012). Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn.
bibtex: '@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten
Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias},
year={2012} }'
chicago: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn, 2012.
ieee: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn, 2012.
mla: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten.
Universität Paderborn, 2012.
short: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:47Z
department:
- _id: '75'
language:
- iso: ger
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: Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '594'
author:
- first_name: Timo
full_name: Klerx, Timo
last_name: Klerx
citation:
ama: Klerx T. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
Netzen. Universität Paderborn; 2012.
apa: Klerx, T. (2012). Online Parameteroptimierung in P2P-Netzwerken mit Hilfe
von Neuronalen Netzen. Universität Paderborn.
bibtex: '@book{Klerx_2012, title={Online Parameteroptimierung in P2P-Netzwerken
mit Hilfe von Neuronalen Netzen}, publisher={Universität Paderborn}, author={Klerx,
Timo}, year={2012} }'
chicago: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe
von Neuronalen Netzen. Universität Paderborn, 2012.
ieee: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
Netzen. Universität Paderborn, 2012.
mla: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von
Neuronalen Netzen. Universität Paderborn, 2012.
short: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
Netzen, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:48Z
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: Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '595'
author:
- first_name: Frederik
full_name: Mallmann Trenn, Frederik
last_name: Mallmann Trenn
citation:
ama: Mallmann Trenn F. On Scheduling with Multi-Core and Multi-Speed Processors
Using Power Down. Universität Paderborn; 2012.
apa: Mallmann Trenn, F. (2012). On scheduling with multi-core and multi-speed
processors using power down. Universität Paderborn.
bibtex: '@book{Mallmann Trenn_2012, title={On scheduling with multi-core and multi-speed
processors using power down}, publisher={Universität Paderborn}, author={Mallmann
Trenn, Frederik}, year={2012} }'
chicago: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed
Processors Using Power Down. Universität Paderborn, 2012.
ieee: F. Mallmann Trenn, On scheduling with multi-core and multi-speed processors
using power down. Universität Paderborn, 2012.
mla: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed
Processors Using Power Down. Universität Paderborn, 2012.
short: F. Mallmann Trenn, On Scheduling with Multi-Core and Multi-Speed Processors
Using Power Down, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:48Z
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: On scheduling with multi-core and multi-speed processors using power down
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '596'
abstract:
- lang: eng
text: To meet quality-of-service requirements in changing environments, modern software
systems adapt themselves. The structure, and correspondingly the behavior, of
these systems undergoes continuous change. Model-driven performance engineering,
however, assumes static system structures, behavior, and deployment. Hence, self-adaptive
systems pose new challenges to model-driven performance engineering. There are
a few surveys on self-adaptive systems, performance engineering, and the combination
of both in the literature. In contrast to existing work, here we focus on model-driven
performance analysis approaches. Based on a systematic literature review, we present
a classication, identify open issues, and outline further research.
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Markus
full_name: Luckey, Markus
last_name: Luckey
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Becker M, Luckey M, Becker S. Model-Driven Performance Engineering of Self-Adaptive
Systems: A Survey. In: Proceedings of the 8th ACM SigSoft International Conference
on Quality of Software Architectures (QoSA’12). ; 2012:117-122. doi:10.1145/2304696.2304716'
apa: 'Becker, M., Luckey, M., & Becker, S. (2012). Model-Driven Performance
Engineering of Self-Adaptive Systems: A Survey. In Proceedings of the 8th ACM
SigSoft International Conference on Quality of Software Architectures (QoSA’12)
(pp. 117–122). https://doi.org/10.1145/2304696.2304716'
bibtex: '@inproceedings{Becker_Luckey_Becker_2012, title={Model-Driven Performance
Engineering of Self-Adaptive Systems: A Survey}, DOI={10.1145/2304696.2304716},
booktitle={Proceedings of the 8th ACM SigSoft International Conference on Quality
of Software Architectures (QoSA’12)}, author={Becker, Matthias and Luckey, Markus
and Becker, Steffen}, year={2012}, pages={117–122} }'
chicago: 'Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance
Engineering of Self-Adaptive Systems: A Survey.” In Proceedings of the 8th
ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12),
117–22, 2012. https://doi.org/10.1145/2304696.2304716.'
ieee: 'M. Becker, M. Luckey, and S. Becker, “Model-Driven Performance Engineering
of Self-Adaptive Systems: A Survey,” in Proceedings of the 8th ACM SigSoft
International Conference on Quality of Software Architectures (QoSA’12), 2012,
pp. 117–122.'
mla: 'Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive
Systems: A Survey.” Proceedings of the 8th ACM SigSoft International Conference
on Quality of Software Architectures (QoSA’12), 2012, pp. 117–22, doi:10.1145/2304696.2304716.'
short: 'M. Becker, M. Luckey, S. Becker, in: Proceedings of the 8th ACM SigSoft
International Conference on Quality of Software Architectures (QoSA’12), 2012,
pp. 117–122.'
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:48Z
ddc:
- '040'
doi: 10.1145/2304696.2304716
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:23:31Z
date_updated: 2018-03-15T08:23:31Z
file_id: '1256'
file_name: 596-qosa25s-becker.pdf
file_size: 141651
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:23:31Z
has_accepted_license: '1'
page: 117-122
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 8th ACM SigSoft International Conference on Quality
of Software Architectures (QoSA'12)
status: public
title: 'Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '597'
abstract:
- lang: eng
text: 'We consider strategic games in which each player seeks a mixed strategy to
minimize her cost evaluated by a concave valuation V (mapping probability distributions
to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer
players where mixed equilibria always exist [15, 16], a mixed equilibrium for
such games, called a V -equilibrium, may fail to exist, even though pure equilibria
(if any) transfer over. What is the impact of such valuations on the existence,
structure and complexity of mixed equilibria? We address this fundamental question
for a particular concave valuation: expectation plus variance, denoted as RA,
which stands for risk-averse; so, variance enters as a measure of risk and it
is used as an additive adjustment to expectation. We obtain the following results
about RA-equilibria:- A collection of general structural properties of RA-equilibria
connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation
and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable
equilibrium properties.- A second collection of (i) existence, (ii) equivalence
and separation (with respect to E-equilibria), and (iii) characterization results
for RA-equilibria in the new class of player-specific scheduling games. Using
examples, we provide the first demonstration that going from E to RA may as well
create new mixed (RA-)equilibria.- A purification technique to transform a player-specific
scheduling game on identical links into a player-specific scheduling game so that
all non-pure RA-equilibria are eliminated while new pure equilibria cannot be
created; so, a particular game on two identical links yields one with no RA-equilibrium.
As a by-product, the first-completeness result for the computation of RA-equilibria
follows.'
author:
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
citation:
ama: 'Mavronicolas M, Monien B. Minimizing Expectation Plus Variance. In: Proceedings
of the 5th International Symposium on Algorithmic Game Theory (SAGT). LNCS.
; 2012:239-250. doi:10.1007/978-3-642-33996-7_21'
apa: Mavronicolas, M., & Monien, B. (2012). Minimizing Expectation Plus Variance.
In Proceedings of the 5th International Symposium on Algorithmic Game Theory
(SAGT) (pp. 239–250). https://doi.org/10.1007/978-3-642-33996-7_21
bibtex: '@inproceedings{Mavronicolas_Monien_2012, series={LNCS}, title={Minimizing
Expectation Plus Variance}, DOI={10.1007/978-3-642-33996-7_21},
booktitle={Proceedings of the 5th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2012},
pages={239–250}, collection={LNCS} }'
chicago: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus
Variance.” In Proceedings of the 5th International Symposium on Algorithmic
Game Theory (SAGT), 239–50. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_21.
ieee: M. Mavronicolas and B. Monien, “Minimizing Expectation Plus Variance,” in
Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT),
2012, pp. 239–250.
mla: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.”
Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT),
2012, pp. 239–50, doi:10.1007/978-3-642-33996-7_21.
short: 'M. Mavronicolas, B. Monien, in: Proceedings of the 5th International Symposium
on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.'
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:48Z
ddc:
- '040'
doi: 10.1007/978-3-642-33996-7_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:20:53Z
date_updated: 2018-03-15T08:20:53Z
file_id: '1254'
file_name: 597-newtocs_01.pdf
file_size: 345826
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:20:53Z
has_accepted_license: '1'
page: 239-250
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 5th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: LNCS
status: public
title: Minimizing Expectation Plus Variance
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '598'
author:
- first_name: Fuad
full_name: Mammadov, Fuad
last_name: Mammadov
citation:
ama: Mammadov F. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen.
Universität Paderborn; 2012.
apa: Mammadov, F. (2012). Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen.
Universität Paderborn.
bibtex: '@book{Mammadov_2012, title={Methoden zur Bestimmung von innerbetrieblichen
Verrechnungspreisen}, publisher={Universität Paderborn}, author={Mammadov, Fuad},
year={2012} }'
chicago: Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen.
Universität Paderborn, 2012.
ieee: F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen.
Universität Paderborn, 2012.
mla: Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen.
Universität Paderborn, 2012.
short: F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:48Z
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
title: Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '599'
author:
- first_name: Xenia
full_name: Löwen, Xenia
last_name: Löwen
citation:
ama: 'Löwen X. Managerial Delegation and Capacity Choices: An Analysis of the
Cournot-Nash Equilibrium. Universität Paderborn; 2012.'
apa: 'Löwen, X. (2012). Managerial Delegation and Capacity Choices: An Analysis
of the Cournot-Nash Equilibrium. Universität Paderborn.'
bibtex: '@book{Löwen_2012, title={Managerial Delegation and Capacity Choices: An
Analysis of the Cournot-Nash Equilibrium}, publisher={Universität Paderborn},
author={Löwen, Xenia}, year={2012} }'
chicago: 'Löwen, Xenia. Managerial Delegation and Capacity Choices: An Analysis
of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.'
ieee: 'X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the
Cournot-Nash Equilibrium. Universität Paderborn, 2012.'
mla: 'Löwen, Xenia. Managerial Delegation and Capacity Choices: An Analysis of
the Cournot-Nash Equilibrium. Universität Paderborn, 2012.'
short: 'X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the
Cournot-Nash Equilibrium, Universität Paderborn, 2012.'
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:49Z
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
title: 'Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash
Equilibrium'
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '600'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
citation:
ama: Feldkord B. Lokale Swaps und überholte Informationen in Basic Network Creation
Games. Universität Paderborn; 2012.
apa: Feldkord, B. (2012). Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn.
bibtex: '@book{Feldkord_2012, title={Lokale Swaps und überholte Informationen in
Basic Network Creation Games}, publisher={Universität Paderborn}, author={Feldkord,
Björn}, year={2012} }'
chicago: Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn, 2012.
ieee: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn, 2012.
mla: Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn, 2012.
short: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation
Games, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:49Z
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: Lokale Swaps und überholte Informationen in Basic Network Creation Games
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '601'
abstract:
- lang: eng
text: Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen
Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich
selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur
seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren
Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen.
In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich
auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden
k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen
vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden
obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz
gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz
mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie
auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren
hergeleitet.
author:
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
citation:
ama: Kempkes B. Local Strategies for Robot Formation Problems. Vol 302. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2012.
apa: Kempkes, B. (2012). Local strategies for robot formation problems (Vol.
302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Local strategies for robot formation problems}, volume={302},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes,
Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Kempkes, Barbara. Local Strategies for Robot Formation Problems.
Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2012.
ieee: B. Kempkes, Local strategies for robot formation problems, vol. 302.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.
mla: Kempkes, Barbara. Local Strategies for Robot Formation Problems. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2012.
short: B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:50Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:16:44Z
date_updated: 2018-03-15T08:16:44Z
file_id: '1252'
file_name: 601-Kempkes-PhD.pdf
file_size: 3805310
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:16:44Z
has_accepted_license: '1'
intvolume: ' 302'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication_identifier:
isbn:
- 978-3-942647-21-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local strategies for robot formation problems
type: dissertation
user_id: '5786'
volume: 302
year: '2012'
...
---
_id: '602'
abstract:
- lang: eng
text: 'We study the consequences of dropping the perfect competition assumption
in a standard infinite horizon model with infinitely-lived traders and real collateralized
assets, together with one additional ingredient: information among players is
asymmetric and monitoring is incomplete. The key insight is that trading assets
is not only a way to hedge oneself against uncertainty and to smooth consumption
across time: It also enables learning information. Conversely, defaulting now
becomes strategic: Certain players may manipulate prices so as to provoke a default
in order to prevent their opponents from learning. We focus on learning equilibria,
at the end of which no player has incorrect beliefs — not because those players
with heterogeneous beliefs were eliminated from the market (although default is
possible at equilibrium) but because they have taken time to update their prior
belief. We prove a partial Folk theorem à la Wiseman (2011) of the following form:
For any function that maps each state of the world to a sequence of feasible and
strongly individually rational allocations, and for any degree of precision, there
is a perfect Bayesian equilibrium in which patient players learn the realized
state with this degree of precision and achieve a payoff close to the one specified
for each state.'
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
citation:
ama: Brangewitz S. Learning by Trading in Infinite Horizon Strategic Market Games
with Default. Universität Paderborn; 2012.
apa: Brangewitz, S. (2012). Learning by Trading in Infinite Horizon Strategic
Market Games with Default. Universität Paderborn.
bibtex: '@book{Brangewitz_2012, title={Learning by Trading in Infinite Horizon Strategic
Market Games with Default}, publisher={Universität Paderborn}, author={Brangewitz,
Sonja}, year={2012} }'
chicago: Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic
Market Games with Default. Universität Paderborn, 2012.
ieee: S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market
Games with Default. Universität Paderborn, 2012.
mla: Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic Market
Games with Default. Universität Paderborn, 2012.
short: S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games
with Default, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:51Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:16:08Z
date_updated: 2018-03-15T08:16:08Z
file_id: '1251'
file_name: 602-12062_01.pdf
file_size: 1284802
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:16:08Z
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
title: Learning by Trading in Infinite Horizon Strategic Market Games with Default
type: report
user_id: '477'
year: '2012'
...
---
_id: '603'
abstract:
- lang: eng
text: 'Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
lightpaths in case not enough resources are available to setup a new lightpath
in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths
to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated
properties of the network topology are required by the applications running on
the network, these requirements have to be known by the RWA algorithm. Otherwise
it might happen that by preempting a particular lightpath these requirements are
violated. If, however, these requirements include parameters only known at the
nodes running the application, the RWA algorithm cannot evaluate the requirements.
For this reason a RWA algorithm is needed which involves its users in the preemption
decisions. We present a family of preemptive RWA algorithms for WDM networks.
These algorithms have two distinguishing features: a) they can handle dynamic
traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration
decisions and thus influence the preemption decision of the RWA algorithm, leading
to networks which adapt directly to application needs. This is different from
traffic engineering where the network is (slowly) adapted to observed traffic patterns.
Our algorithms handle various WDM network configurations including networks consisting
of heterogeneous WDM hardware. To this end, we are using the layered graph approach
together with a newly developed graph model that is used to determine conflicting
lightpaths.'
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Wette P, Karl H. Introducing Feedback to Preemptive Routing and Wavelength
Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn;
2012.
apa: Wette, P., & Karl, H. (2012). Introducing feedback to preemptive routing
and wavelength assignment algorithms for dynamic traffic scenarios. Universität
Paderborn.
bibtex: '@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing
and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität
Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }'
chicago: Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing
and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität
Paderborn, 2012.
ieee: P. Wette and H. Karl, Introducing feedback to preemptive routing and wavelength
assignment algorithms for dynamic traffic scenarios. Universität Paderborn,
2012.
mla: Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing
and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität
Paderborn, 2012.
short: P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength
Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:51Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: hkarl
date_created: 2018-03-09T09:57:26Z
date_updated: 2018-03-09T09:57:26Z
file_id: '1205'
file_name: underlayMod2.pdf
file_size: 717326
relation: main_file
success: 1
file_date_updated: 2018-03-09T09:57:26Z
has_accepted_license: '1'
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: Introducing feedback to preemptive routing and wavelength assignment algorithms
for dynamic traffic scenarios
type: report
user_id: '126'
year: '2012'
...
---
_id: '604'
author:
- first_name: Henrik
full_name: Seier, Henrik
last_name: Seier
citation:
ama: Seier H. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe
gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen.
Universität Paderborn; 2012.
apa: Seier, H. (2012). Implementierung eines Branch-and-Bound-Algorithmus für
nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen.
Universität Paderborn.
bibtex: '@book{Seier_2012, title={Implementierung eines Branch-and-Bound-Algorithmus
für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen},
publisher={Universität Paderborn}, author={Seier, Henrik}, year={2012} }'
chicago: Seier, Henrik. Implementierung eines Branch-and-Bound-Algorithmus für
nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen.
Universität Paderborn, 2012.
ieee: H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe
gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen.
Universität Paderborn, 2012.
mla: Seier, Henrik. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe
gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen.
Universität Paderborn, 2012.
short: H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe
gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:51Z
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: Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige
Optimierungsprobleme mit quadratischen Nebenbedingungen
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '605'
author:
- first_name: Florian
full_name: Isenberg, Florian
last_name: Isenberg
citation:
ama: Isenberg F. Implementierung eines adaptiven Verfahrens zur Linearisierung
von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung.
Universität Paderborn; 2012.
apa: Isenberg, F. (2012). Implementierung eines adaptiven Verfahrens zur Linearisierung
von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung.
Universität Paderborn.
bibtex: '@book{Isenberg_2012, title={Implementierung eines adaptiven Verfahrens
zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe
einer Fehlerabschätzung}, publisher={Universität Paderborn}, author={Isenberg,
Florian}, year={2012} }'
chicago: Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung
von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung.
Universität Paderborn, 2012.
ieee: F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung
von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung.
Universität Paderborn, 2012.
mla: Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung
von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung.
Universität Paderborn, 2012.
short: F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung
von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
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: Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen,
nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '6055'
author:
- first_name: Alexander
full_name: Mehler, Alexander
last_name: Mehler
- first_name: Andy
full_name: Lücking, Andy
last_name: Lücking
- first_name: Peter
full_name: Menke, Peter
id: '59649'
last_name: Menke
citation:
ama: Mehler A, Lücking A, Menke P. Assessing cognitive alignment in different types
of dialog by means of a network model. Neural Networks. 2012;32:159-164.
doi:10.1016/j.neunet.2012.02.013
apa: Mehler, A., Lücking, A., & Menke, P. (2012). Assessing cognitive alignment
in different types of dialog by means of a network model. Neural Networks,
32, 159–164. https://doi.org/10.1016/j.neunet.2012.02.013
bibtex: '@article{Mehler_Lücking_Menke_2012, title={Assessing cognitive alignment
in different types of dialog by means of a network model}, volume={32}, DOI={10.1016/j.neunet.2012.02.013},
journal={Neural Networks}, publisher={Elsevier BV}, author={Mehler, Alexander
and Lücking, Andy and Menke, Peter}, year={2012}, pages={159–164} }'
chicago: 'Mehler, Alexander, Andy Lücking, and Peter Menke. “Assessing Cognitive
Alignment in Different Types of Dialog by Means of a Network Model.” Neural
Networks 32 (2012): 159–64. https://doi.org/10.1016/j.neunet.2012.02.013.'
ieee: A. Mehler, A. Lücking, and P. Menke, “Assessing cognitive alignment in different
types of dialog by means of a network model,” Neural Networks, vol. 32,
pp. 159–164, 2012.
mla: Mehler, Alexander, et al. “Assessing Cognitive Alignment in Different Types
of Dialog by Means of a Network Model.” Neural Networks, vol. 32, Elsevier
BV, 2012, pp. 159–64, doi:10.1016/j.neunet.2012.02.013.
short: A. Mehler, A. Lücking, P. Menke, Neural Networks 32 (2012) 159–164.
date_created: 2018-12-07T15:17:39Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '115'
doi: 10.1016/j.neunet.2012.02.013
extern: '1'
intvolume: ' 32'
language:
- iso: eng
page: 159-164
publication: Neural Networks
publication_identifier:
issn:
- 0893-6080
publication_status: published
publisher: Elsevier BV
status: public
title: Assessing cognitive alignment in different types of dialog by means of a network
model
type: journal_article
user_id: '59649'
volume: 32
year: '2012'
...
---
_id: '6057'
author:
- first_name: Peter
full_name: Menke, Peter
id: '59649'
last_name: Menke
citation:
ama: 'Menke P. Evaluation of Technical Communication. In: Handbook of Technical
Communication. Vol 8. Handbooks of Applied Linguistics. de Gruyter; 2012:285–314.'
apa: Menke, P. (2012). Evaluation of Technical Communication. In Handbook of
Technical Communication (Vol. 8, pp. 285–314). de Gruyter.
bibtex: '@inbook{Menke_2012, series={Handbooks of Applied Linguistics}, title={Evaluation
of Technical Communication}, volume={8}, booktitle={Handbook of Technical Communication},
publisher={de Gruyter}, author={Menke, Peter}, year={2012}, pages={285–314}, collection={Handbooks
of Applied Linguistics} }'
chicago: Menke, Peter. “Evaluation of Technical Communication.” In Handbook of
Technical Communication, 8:285–314. Handbooks of Applied Linguistics. de Gruyter,
2012.
ieee: P. Menke, “Evaluation of Technical Communication,” in Handbook of Technical
Communication, vol. 8, de Gruyter, 2012, pp. 285–314.
mla: Menke, Peter. “Evaluation of Technical Communication.” Handbook of Technical
Communication, vol. 8, de Gruyter, 2012, pp. 285–314.
short: 'P. Menke, in: Handbook of Technical Communication, de Gruyter, 2012, pp.
285–314.'
date_created: 2018-12-07T15:22:25Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '115'
extern: '1'
intvolume: ' 8'
language:
- iso: eng
page: 285–314
publication: Handbook of Technical Communication
publication_identifier:
isbn:
- 978-3-11-018834-9
publication_status: published
publisher: de Gruyter
series_title: Handbooks of Applied Linguistics
status: public
title: Evaluation of Technical Communication
type: book_chapter
user_id: '59649'
volume: 8
year: '2012'
...
---
_id: '606'
author:
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: Löken N. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas.
Universität Paderborn; 2012.
apa: Löken, N. (2012). Identitätsbasierte Signaturen - Ein Sicherheitsbeweis
für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas.
Universität Paderborn.
bibtex: '@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis
für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas},
publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }'
chicago: Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für
Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas.
Universität Paderborn, 2012.
ieee: N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas.
Universität Paderborn, 2012.
mla: Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas.
Universität Paderborn, 2012.
short: N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität
Paderborn, 2012.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '64'
language:
- iso: ger
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: Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage
von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas
type: bachelorsthesis
user_id: '13703'
year: '2012'
...
---
_id: '607'
author:
- first_name: Thomas
full_name: Haarhoff, Thomas
last_name: Haarhoff
citation:
ama: Haarhoff T. Identitätsbasierte Kryptographie - Implementierung von Paarungen
für Körper der Charakteristik 2. Universität Paderborn; 2012.
apa: Haarhoff, T. (2012). Identitätsbasierte Kryptographie - Implementierung
von Paarungen für Körper der Charakteristik 2. Universität Paderborn.
bibtex: '@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung
von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn},
author={Haarhoff, Thomas}, year={2012} }'
chicago: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung
von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
ieee: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen
für Körper der Charakteristik 2. Universität Paderborn, 2012.
mla: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von
Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
short: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen
für Körper der Charakteristik 2, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '64'
language:
- iso: ger
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: Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper
der Charakteristik 2
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '608'
abstract:
- lang: eng
text: 'Predicate abstraction is an established technique in software verification.
It inherently includes an abstraction refinement loop successively adding predicates
until the right level of abstraction is found. For concurrent systems, predicate
abstraction can be combined with spotlight abstraction, further reducing the state
space by abstracting away certain processes. Refinement then has to decide whether
to add a new predicate or a new process. Selecting the right predicates and processes
is a crucial task: The positive effect of abstraction may be compromised by unfavourable
refinement decisions. Here we present a heuristic approach to abstraction refinement.
The basis for a decision is a set of refinement candidates, derived by multiple
counterexample-generation. Candidates are evaluated with respect to their influence
on other components in the system. Experimental results show that our technique
can significantly speed up verification as compared to a naive abstraction refinement.'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: 'Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent
Systems. In: Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM). LNCS. ; 2012:348-363. doi:10.1007/978-3-642-34281-3_25'
apa: Timm, N., Wehrheim, H., & Czech, M. (2012). Heuristic-Guided Abstraction
Refinement for Concurrent Systems. In Proceedings of the 14th International
Conference on Formal Engineering Methods (ICFEM) (pp. 348–363). https://doi.org/10.1007/978-3-642-34281-3_25
bibtex: '@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided
Abstraction Refinement for Concurrent Systems}, DOI={10.1007/978-3-642-34281-3_25},
booktitle={Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012},
pages={348–363}, collection={LNCS} }'
chicago: Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction
Refinement for Concurrent Systems.” In Proceedings of the 14th International
Conference on Formal Engineering Methods (ICFEM), 348–63. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_25.
ieee: N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement
for Concurrent Systems,” in Proceedings of the 14th International Conference
on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.
mla: Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent
Systems.” Proceedings of the 14th International Conference on Formal Engineering
Methods (ICFEM), 2012, pp. 348–63, doi:10.1007/978-3-642-34281-3_25.
short: 'N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International
Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.'
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:52Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-34281-3_25
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:15:33Z
date_updated: 2018-03-15T08:15:33Z
file_id: '1250'
file_name: 608-Timm2013-0main.pdf
file_size: 396337
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:15:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 348-363
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 14th International Conference on Formal Engineering
Methods (ICFEM)
series_title: LNCS
status: public
title: Heuristic-Guided Abstraction Refinement for Concurrent Systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '610'
author:
- first_name: Mario
full_name: Mohr, Mario
last_name: Mohr
citation:
ama: Mohr M. Generating Prototypes of Adaptive Component-Based Software Systems
for Performance Analysis. Universität Paderborn; 2012.
apa: Mohr, M. (2012). Generating Prototypes of Adaptive Component-based Software
Systems for Performance Analysis. Universität Paderborn.
bibtex: '@book{Mohr_2012, title={Generating Prototypes of Adaptive Component-based
Software Systems for Performance Analysis}, publisher={Universität Paderborn},
author={Mohr, Mario}, year={2012} }'
chicago: Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software
Systems for Performance Analysis. Universität Paderborn, 2012.
ieee: M. Mohr, Generating Prototypes of Adaptive Component-based Software Systems
for Performance Analysis. Universität Paderborn, 2012.
mla: Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software
Systems for Performance Analysis. Universität Paderborn, 2012.
short: M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems
for Performance Analysis, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:52Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:13:40Z
date_updated: 2018-03-15T08:13:40Z
file_id: '1248'
file_name: 610-MA_Mohr_2012_final.pdf
file_size: 1270467
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:13:40Z
has_accepted_license: '1'
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: Generating Prototypes of Adaptive Component-based Software Systems for Performance
Analysis
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '6102'
author:
- first_name: Holger
full_name: Steinmetz, Holger
id: '43261'
last_name: Steinmetz
- first_name: C
full_name: Schwens, C
last_name: Schwens
- first_name: M
full_name: Wehner, M
last_name: Wehner
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: 'Steinmetz H, Schwens C, Wehner M, Kabst R. Das Cranet-Projekt: Kreuzkulturelle
Vergleiche im HR-Management. PERSONALquartely. 2012;64(1):34-39.'
apa: 'Steinmetz, H., Schwens, C., Wehner, M., & Kabst, R. (2012). Das Cranet-Projekt:
Kreuzkulturelle Vergleiche im HR-Management. PERSONALquartely, 64(1),
34–39.'
bibtex: '@article{Steinmetz_Schwens_Wehner_Kabst_2012, title={Das Cranet-Projekt:
Kreuzkulturelle Vergleiche im HR-Management.}, volume={64}, number={1}, journal={PERSONALquartely},
author={Steinmetz, Holger and Schwens, C and Wehner, M and Kabst, Rüdiger}, year={2012},
pages={34–39} }'
chicago: 'Steinmetz, Holger, C Schwens, M Wehner, and Rüdiger Kabst. “Das Cranet-Projekt:
Kreuzkulturelle Vergleiche Im HR-Management.” PERSONALquartely 64, no.
1 (2012): 34–39.'
ieee: 'H. Steinmetz, C. Schwens, M. Wehner, and R. Kabst, “Das Cranet-Projekt: Kreuzkulturelle
Vergleiche im HR-Management.,” PERSONALquartely, vol. 64, no. 1, pp. 34–39,
2012.'
mla: 'Steinmetz, Holger, et al. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche
Im HR-Management.” PERSONALquartely, vol. 64, no. 1, 2012, pp. 34–39.'
short: H. Steinmetz, C. Schwens, M. Wehner, R. Kabst, PERSONALquartely 64 (2012)
34–39.
date_created: 2018-12-10T11:09:13Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
intvolume: ' 64'
issue: '1'
language:
- iso: eng
page: 34-39
publication: PERSONALquartely
status: public
title: 'Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.'
type: journal_article
user_id: '46632'
volume: 64
year: '2012'
...
---
_id: '6103'
author:
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
- first_name: M
full_name: Baum, M
last_name: Baum
citation:
ama: 'Kabst R, Baum M. Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.
PERSONALquartely. 2012;64(3):3.'
apa: 'Kabst, R., & Baum, M. (2012). Editorial: Employer Branding: Strategie,
Instrumente, Umsetzung. PERSONALquartely, 64(3), 3.'
bibtex: '@article{Kabst_Baum_2012, title={Editorial: Employer Branding: Strategie,
Instrumente, Umsetzung}, volume={64}, number={3}, journal={PERSONALquartely},
author={Kabst, Rüdiger and Baum, M}, year={2012}, pages={3} }'
chicago: 'Kabst, Rüdiger, and M Baum. “Editorial: Employer Branding: Strategie,
Instrumente, Umsetzung.” PERSONALquartely 64, no. 3 (2012): 3.'
ieee: 'R. Kabst and M. Baum, “Editorial: Employer Branding: Strategie, Instrumente,
Umsetzung,” PERSONALquartely, vol. 64, no. 3, p. 3, 2012.'
mla: 'Kabst, Rüdiger, and M. Baum. “Editorial: Employer Branding: Strategie, Instrumente,
Umsetzung.” PERSONALquartely, vol. 64, no. 3, 2012, p. 3.'
short: R. Kabst, M. Baum, PERSONALquartely 64 (2012) 3.
date_created: 2018-12-10T11:39:27Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
intvolume: ' 64'
issue: '3'
language:
- iso: eng
page: '3'
publication: PERSONALquartely
status: public
title: 'Editorial: Employer Branding: Strategie, Instrumente, Umsetzung'
type: journal_article
user_id: '46632'
volume: 64
year: '2012'
...
---
_id: '611'
author:
- first_name: Hendrik
full_name: Hangmann, Hendrik
last_name: Hangmann
citation:
ama: Hangmann H. Generating Adjustable Temperature Gradients on Modern FPGAs.
Universität Paderborn; 2012.
apa: Hangmann, H. (2012). Generating Adjustable Temperature Gradients on modern
FPGAs. Universität Paderborn.
bibtex: '@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients
on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik},
year={2012} }'
chicago: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern
FPGAs. Universität Paderborn, 2012.
ieee: H. Hangmann, Generating Adjustable Temperature Gradients on modern FPGAs.
Universität Paderborn, 2012.
mla: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern
FPGAs. Universität Paderborn, 2012.
short: H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
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: Generating Adjustable Temperature Gradients on modern FPGAs
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '613'
author:
- first_name: Stefan
full_name: Wohlfarth, Stefan
last_name: Wohlfarth
citation:
ama: Wohlfarth S. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung
mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn; 2012.
apa: Wohlfarth, S. (2012). Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn.
bibtex: '@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens},
publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }'
chicago: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
ieee: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in
Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
mla: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
short: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung
mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
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: Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der
Analyse und Implementierung eines hydraulischen Simulationsverfahrens
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '6138'
author:
- first_name: W
full_name: Weber, W
last_name: Weber
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: Weber W, Kabst R. Einführung in Die Betriebswirtschaftslehre. 8th ed.
Wiesbaden; 2012.
apa: Weber, W., & Kabst, R. (2012). Einführung in die Betriebswirtschaftslehre
(8th ed.). Wiesbaden.
bibtex: '@book{Weber_Kabst_2012, place={Wiesbaden}, edition={8}, title={Einführung
in die Betriebswirtschaftslehre}, author={Weber, W and Kabst, Rüdiger}, year={2012}
}'
chicago: Weber, W, and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre.
8th ed. Wiesbaden, 2012.
ieee: W. Weber and R. Kabst, Einführung in die Betriebswirtschaftslehre,
8th ed. Wiesbaden, 2012.
mla: Weber, W., and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre.
8th ed., 2012.
short: W. Weber, R. Kabst, Einführung in Die Betriebswirtschaftslehre, 8th ed.,
Wiesbaden, 2012.
date_created: 2018-12-11T10:21:09Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
edition: '8'
language:
- iso: eng
place: Wiesbaden
publication_identifier:
isbn:
- 978-3-8349-1994-6
status: public
title: Einführung in die Betriebswirtschaftslehre
type: book
user_id: '46632'
year: '2012'
...
---
_id: '614'
author:
- first_name: Sebastian
full_name: Lehrig, Sebastian
last_name: Lehrig
citation:
ama: Lehrig S. Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn; 2012.
apa: Lehrig, S. (2012). Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn.
bibtex: '@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen},
publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }'
chicago: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn, 2012.
ieee: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn, 2012.
mla: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn, 2012.
short: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
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: Empirischer, quantitativer Vergleich von Modelltransformationssprachen
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '6148'
author:
- first_name: M
full_name: Baum, M
last_name: Baum
- first_name: C
full_name: Schwens, C
last_name: Schwens
- first_name: R
full_name: Kabst, R
last_name: Kabst
citation:
ama: 'Baum M, Schwens C, Kabst R. Determinants of Different Types of Born Globals.
In: Gabrielsson M, Kirpalani M, eds. Handbook of Research on Born Globals.
Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.; 2012:36-45.'
apa: 'Baum, M., Schwens, C., & Kabst, R. (2012). Determinants of Different Types
of Born Globals. In M. Gabrielsson & M. Kirpalani (Eds.), Handbook of Research
on Born Globals (pp. 36–45). Cheltenham Glos/Northampton: Edward Elgar Publishing
Ltd.'
bibtex: '@inbook{Baum_Schwens_Kabst_2012, place={Cheltenham Glos/Northampton}, title={Determinants
of Different Types of Born Globals.}, booktitle={Handbook of Research on Born
Globals}, publisher={Edward Elgar Publishing Ltd.}, author={Baum, M and Schwens,
C and Kabst, R}, editor={Gabrielsson, M and Kirpalani, MEditors}, year={2012},
pages={36–45} }'
chicago: 'Baum, M, C Schwens, and R Kabst. “Determinants of Different Types of Born
Globals.” In Handbook of Research on Born Globals, edited by M Gabrielsson
and M Kirpalani, 36–45. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.,
2012.'
ieee: 'M. Baum, C. Schwens, and R. Kabst, “Determinants of Different Types of Born
Globals.,” in Handbook of Research on Born Globals, M. Gabrielsson and
M. Kirpalani, Eds. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.,
2012, pp. 36–45.'
mla: Baum, M., et al. “Determinants of Different Types of Born Globals.” Handbook
of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, Edward
Elgar Publishing Ltd., 2012, pp. 36–45.
short: 'M. Baum, C. Schwens, R. Kabst, in: M. Gabrielsson, M. Kirpalani (Eds.),
Handbook of Research on Born Globals, Edward Elgar Publishing Ltd., Cheltenham
Glos/Northampton, 2012, pp. 36–45.'
date_created: 2018-12-11T11:02:56Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
editor:
- first_name: M
full_name: Gabrielsson, M
last_name: Gabrielsson
- first_name: M
full_name: Kirpalani, M
last_name: Kirpalani
language:
- iso: eng
page: 36-45
place: Cheltenham Glos/Northampton
publication: Handbook of Research on Born Globals
publisher: Edward Elgar Publishing Ltd.
status: public
title: Determinants of Different Types of Born Globals.
type: book_chapter
user_id: '46632'
year: '2012'
...
---
_id: '6149'
author:
- first_name: R
full_name: Isidor, R
last_name: Isidor
- first_name: C
full_name: Schwens, C
last_name: Schwens
- first_name: R
full_name: Kabst, R
last_name: Kabst
citation:
ama: 'Isidor R, Schwens C, Kabst R. Die Messung von Joint-Venture Erfolg. In: Zentes
J, ed. Markteintrittsstrategien - Dynamik Und Komplexität. ; 2012:193-205.'
apa: Isidor, R., Schwens, C., & Kabst, R. (2012). Die Messung von Joint-Venture
Erfolg. In J. Zentes (Ed.), Markteintrittsstrategien - Dynamik und Komplexität
(pp. 193–205).
bibtex: '@inbook{Isidor_Schwens_Kabst_2012, title={Die Messung von Joint-Venture
Erfolg}, booktitle={Markteintrittsstrategien - Dynamik und Komplexität}, author={Isidor,
R and Schwens, C and Kabst, R}, editor={Zentes, JEditor}, year={2012}, pages={193–205}
}'
chicago: Isidor, R, C Schwens, and R Kabst. “Die Messung von Joint-Venture Erfolg.”
In Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes,
193–205, 2012.
ieee: R. Isidor, C. Schwens, and R. Kabst, “Die Messung von Joint-Venture Erfolg,”
in Markteintrittsstrategien - Dynamik und Komplexität, J. Zentes, Ed. 2012,
pp. 193–205.
mla: Isidor, R., et al. “Die Messung von Joint-Venture Erfolg.” Markteintrittsstrategien
- Dynamik Und Komplexität, edited by J Zentes, 2012, pp. 193–205.
short: 'R. Isidor, C. Schwens, R. Kabst, in: J. Zentes (Ed.), Markteintrittsstrategien
- Dynamik Und Komplexität, 2012, pp. 193–205.'
date_created: 2018-12-11T11:06:03Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
editor:
- first_name: J
full_name: Zentes, J
last_name: Zentes
language:
- iso: eng
page: 193-205
publication: Markteintrittsstrategien - Dynamik und Komplexität
publication_identifier:
isbn:
- 978-3-8349-3503-8
status: public
title: Die Messung von Joint-Venture Erfolg
type: book_chapter
user_id: '46632'
year: '2012'
...
---
_id: '616'
author:
- first_name: Sven
full_name: Kluczniok, Sven
last_name: Kluczniok
citation:
ama: Kluczniok S. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn; 2012.
apa: Kluczniok, S. (2012). Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn.
bibtex: '@book{Kluczniok_2012, title={Effiziente Paketbildung in mehrdimensionalen
Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Kluczniok,
Sven}, year={2012} }'
chicago: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn, 2012.
ieee: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn, 2012.
mla: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn, 2012.
short: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:54Z
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
title: Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '617'
abstract:
- lang: eng
text: In this paper, a color based feature extraction and classification approach
for image processing in embedded systems in presented. The algorithms and data
structures developed for this approach pay particular attention to reduce memory
consumption and computation power of the entire image processing, since embedded
systems usually impose strong restrictions regarding those resources. The feature
extraction is realized in terms of an image segmentation algorithm. The criteria
of homogeneity for merging pixels and regions is provided by the color classification
mechanism, which incorporates appropriate methods for defining, representing and
accessing subspaces in the working color space. By doing so, pixels and regions
with color values that belong to the same color class can be merged. Furthermore,
pixels with redundant color values that do not belong to any pre-defined color
class can be completely discarded in order to minimize computational effort. Subsequently,
the extracted regions are converted to a more convenient feature representation
in terms of statistical moments up to and including second order. For evaluation,
the whole image processing approach is applied to a mobile representative of embedded
systems within the scope of a simple real-world scenario.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Bernd
full_name: Kleinjohann, Bernd
last_name: Kleinjohann
- first_name: Elisabeth
full_name: Kleinjohann, Elisabeth
id: '15588'
last_name: Kleinjohann
- first_name: Maarten
full_name: Bieshaar, Maarten
last_name: Bieshaar
citation:
ama: 'Jungmann A, Kleinjohann B, Kleinjohann E, Bieshaar M. Efficient Color-Based
Image Segmentation and Feature Classification for Image Processing in Embedded
Systems. In: Proceedings of the Fourth International Conference on Resource
Intensive Applications and Services (INTENSIVE). ; 2012:22-29.'
apa: Jungmann, A., Kleinjohann, B., Kleinjohann, E., & Bieshaar, M. (2012).
Efficient Color-Based Image Segmentation and Feature Classification for Image
Processing in Embedded Systems. In Proceedings of the Fourth International
Conference on Resource Intensive Applications and Services (INTENSIVE) (pp.
22–29).
bibtex: '@inproceedings{Jungmann_Kleinjohann_Kleinjohann_Bieshaar_2012, title={Efficient
Color-Based Image Segmentation and Feature Classification for Image Processing
in Embedded Systems}, booktitle={Proceedings of the Fourth International Conference
on Resource Intensive Applications and Services (INTENSIVE)}, author={Jungmann,
Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten},
year={2012}, pages={22–29} }'
chicago: Jungmann, Alexander, Bernd Kleinjohann, Elisabeth Kleinjohann, and Maarten
Bieshaar. “Efficient Color-Based Image Segmentation and Feature Classification
for Image Processing in Embedded Systems.” In Proceedings of the Fourth International
Conference on Resource Intensive Applications and Services (INTENSIVE), 22–29,
2012.
ieee: A. Jungmann, B. Kleinjohann, E. Kleinjohann, and M. Bieshaar, “Efficient Color-Based
Image Segmentation and Feature Classification for Image Processing in Embedded
Systems,” in Proceedings of the Fourth International Conference on Resource
Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29.
mla: Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature
Classification for Image Processing in Embedded Systems.” Proceedings of the
Fourth International Conference on Resource Intensive Applications and Services
(INTENSIVE), 2012, pp. 22–29.
short: 'A. Jungmann, B. Kleinjohann, E. Kleinjohann, M. Bieshaar, in: Proceedings
of the Fourth International Conference on Resource Intensive Applications and
Services (INTENSIVE), 2012, pp. 22–29.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:55Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:47:50Z
date_updated: 2018-03-15T06:47:50Z
file_id: '1245'
file_name: 617-INTENSIVE2012-Jungmann.pdf
file_size: 2787964
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:47:50Z
has_accepted_license: '1'
page: 22-29
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 Fourth International Conference on Resource Intensive
Applications and Services (INTENSIVE)
related_material:
link:
- relation: confirmation
url: http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031
status: public
title: Efficient Color-Based Image Segmentation and Feature Classification for Image
Processing in Embedded Systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '618'
author:
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
citation:
ama: Kurras S. Distributed Sampling of Regular Graphs. Universität Paderborn;
2012.
apa: Kurras, S. (2012). Distributed Sampling of Regular Graphs. Universität
Paderborn.
bibtex: '@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität
Paderborn}, author={Kurras, Sven}, year={2012} }'
chicago: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität
Paderborn, 2012.
ieee: S. Kurras, Distributed Sampling of Regular Graphs. Universität Paderborn,
2012.
mla: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn,
2012.
short: S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn,
2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:55Z
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: Distributed Sampling of Regular Graphs
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '619'
abstract:
- lang: eng
text: 'Dynamics in networks is caused by a variety of reasons, like nodes moving
in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer
networks, evolution in social networks, and many others. In order to understand
such kinds of dynamics, and to design distributed algorithms that behave well
under dynamics, many ways to model dynamics are introduced and analyzed w.r.t.
correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman
have introduced a very general, worst case type model of dynamics: The edge set
of the network may change arbitrarily from step to step, the only restriction
is that it is connected at all times and the set of nodes does not change. An
extended model demands that a xed connected subnetwork is maintained over each
time interval of length T (T-interval dynamics). They have presented, among others,
algorithms for counting the number of nodes under such general models of dynamics.In
this paper, we generalize their models and algorithms by adding random edge faults,
i.e., we consider fault-prone dynamic networks: We assume that an edge currently
existing may fail to transmit data with some probability p. We rst observe that
strong counting, i.e., each node knows the correct count and stops, is not possible
in a model with random edge faults. Our main two positive results are feasibility
and runtime bounds for weak counting, i.e., stopping is no longer required (but
still a correct count in each node), and for strong counting with an upper bound,
i.e., an upper bound N on n is known to all nodes.'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic
Networks. In: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic
Distributed Systems (TADDS). ICPS. ; 2012:9-14. doi:10.1145/2414815.2414818'
apa: Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in
Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818
bibtex: '@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed
Computing in Fault-Prone Dynamic Networks}, DOI={10.1145/2414815.2414818},
booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm},
year={2012}, pages={9–14}, collection={ICPS} }'
chicago: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
in Fault-Prone Dynamic Networks.” In Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS), 9–14. ICPS, 2012. https://doi.org/10.1145/2414815.2414818.
ieee: P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone
Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects
of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.
mla: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818.
short: 'P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop
on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2414815.2414818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:47:15Z
date_updated: 2018-03-15T06:47:15Z
file_id: '1244'
file_name: 619-Brandes_MadHTADDS12_01.pdf
file_size: 346044
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:47:15Z
has_accepted_license: '1'
page: 9-14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
Systems (TADDS)
series_title: ICPS
status: public
title: Distributed Computing in Fault-Prone Dynamic Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '620'
author:
- first_name: Robert
full_name: Mittendorf, Robert
last_name: Mittendorf
citation:
ama: Mittendorf R. Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn; 2012.
apa: Mittendorf, R. (2012). Datenschutzgerechtes DRM im Cloud Computing.
Universität Paderborn.
bibtex: '@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing},
publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }'
chicago: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing.
Universität Paderborn, 2012.
ieee: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn, 2012.
mla: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn, 2012.
short: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn,
2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
language:
- iso: ger
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: Datenschutzgerechtes DRM im Cloud Computing
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '621'
author:
- first_name: Stephan
full_name: Sekula, Stephan
last_name: Sekula
citation:
ama: Sekula S. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn; 2012.
apa: Sekula, S. (2012). Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing. Universität Paderborn.
bibtex: '@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012}
}'
chicago: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing. Universität Paderborn, 2012.
ieee: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn, 2012.
mla: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn, 2012.
short: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:57Z
language:
- iso: ger
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: Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '622'
abstract:
- lang: eng
text: Behavioral modeling languages are most useful if their behavior is specified
formally such that it can e.g. be analyzed and executed automatically. Obviously,
the quality of such behavior specifications is crucial. The rule-based semantics
specification technique Dynamic Meta Modeling (DMM) honors this by using the approach
of Test-driven Semantics Specification (TDSS), which makes sure that the specification
at hand at least describes the correct behavior for a suite of test models. However,
in its current state TDSS does not provide any means to measure the quality of
such a test suite. In this paper, we describe how we have applied the idea of
test coverage to TDSS. Similar to common approaches of defining test coverage
criteria, we describe a data structure called invocation graph containing possible
orders of applications ofDMM rules. Then we define different coverage criteria
based on that data structure, taking the rule applications caused by the test
suite’s models into account. Our implementation of the described approach gives
the language engineer using DMM a means to reason about the quality of the language’s
test suite, and also provides hints on how to improve that quality by adding dedicated
test models to the test suite.
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
citation:
ama: 'Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications.
In: Proceedings of the 11th International Workshop on Graph Transformation
and Visual Modeling Techniques (GT-VMT). Electronic Communications of the
EASST. ; 2012. doi:10.14279/tuj.eceasst.47.718'
apa: Arifulina, S., Engels, G., & Soltenborn, C. (2012). Coverage Criteria for
Testing DMM Specifications. In Proceedings of the 11th International Workshop
on Graph Transformation and Visual Modeling Techniques (GT-VMT). https://doi.org/10.14279/tuj.eceasst.47.718
bibtex: '@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications
of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={10.14279/tuj.eceasst.47.718},
booktitle={Proceedings of the 11th International Workshop on Graph Transformation
and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels,
Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications
of the EASST} }'
chicago: Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage
Criteria for Testing DMM Specifications.” In Proceedings of the 11th International
Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT).
Electronic Communications of the EASST, 2012. https://doi.org/10.14279/tuj.eceasst.47.718.
ieee: S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing
DMM Specifications,” in Proceedings of the 11th International Workshop on Graph
Transformation and Visual Modeling Techniques (GT-VMT), 2012.
mla: Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.”
Proceedings of the 11th International Workshop on Graph Transformation and
Visual Modeling Techniques (GT-VMT), 2012, doi:10.14279/tuj.eceasst.47.718.
short: 'S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International
Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:57Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.14279/tuj.eceasst.47.718
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:46:40Z
date_updated: 2018-03-15T06:46:40Z
file_id: '1243'
file_name: 622-gtvmt2012-Arifulina_01.pdf
file_size: 301602
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:46:40Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Workshop on Graph Transformation
and Visual Modeling Techniques (GT-VMT)
series_title: Electronic Communications of the EASST
status: public
title: Coverage Criteria for Testing DMM Specifications
type: conference
user_id: '14955'
year: '2012'
...