---
_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'
...