---
_id: '37068'
author:
- first_name: 'R. '
full_name: 'Doemer, R. '
last_name: Doemer
- first_name: A.
full_name: Gerstlauer, A.
last_name: Gerstlauer
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Doemer R, Gerstlauer A, Müller W. Hardware-dependent Software for Multi- and
Many-Core Embedded Systems. In: Proceedings of ASP-DAC’09. ; 2009.'
apa: Doemer, R., Gerstlauer, A., & Müller, W. (2009). Hardware-dependent Software
for Multi- and Many-Core Embedded Systems. Proceedings of ASP-DAC’09.
bibtex: '@inproceedings{Doemer_Gerstlauer_Müller_2009, place={Yokohama, Japan},
title={Hardware-dependent Software for Multi- and Many-Core Embedded Systems},
booktitle={Proceedings of ASP-DAC’09}, author={Doemer, R. and Gerstlauer, A.
and Müller, Wolfgang}, year={2009} }'
chicago: Doemer, R. , A. Gerstlauer, and Wolfgang Müller. “Hardware-Dependent Software
for Multi- and Many-Core Embedded Systems.” In Proceedings of ASP-DAC’09.
Yokohama, Japan, 2009.
ieee: R. Doemer, A. Gerstlauer, and W. Müller, “Hardware-dependent Software for
Multi- and Many-Core Embedded Systems,” 2009.
mla: Doemer, R., et al. “Hardware-Dependent Software for Multi- and Many-Core Embedded
Systems.” Proceedings of ASP-DAC’09, 2009.
short: 'R. Doemer, A. Gerstlauer, W. Müller, in: Proceedings of ASP-DAC’09, Yokohama,
Japan, 2009.'
date_created: 2023-01-17T11:56:21Z
date_updated: 2023-01-17T11:56:40Z
department:
- _id: '672'
language:
- iso: eng
place: Yokohama, Japan
publication: Proceedings of ASP-DAC'09
status: public
title: Hardware-dependent Software for Multi- and Many-Core Embedded Systems
type: conference
user_id: '5786'
year: '2009'
...
---
_id: '8180'
abstract:
- lang: eng
text: 'Given a bipartite quantum state rho with subsystems A and B of arbitrary
dimensions, we study the entanglement detecting capabilities of locally noneffective,
or cyclic, unitary operations [L. B. Fu, Europhys. Lett., vol. 75, pp. 1-7, 2006].
Local cyclic unitaries have the special property that they leave their target
subsystem invariant. We investigate the distance between rho and the global state
after local application of such unitaries as a possible indicator of entanglement.
To this end, we derive and discuss closed formulae for the maximal such distance
achievable for three cases of interest: (pseudo)pure quantum states, Werner states,
and two-qubit states. What makes this criterion interesting, as we show here,
is that it surprisingly displays behavior similar to recent anomalies observed
for non-locality measures in higher dimensions, as well as demonstrates an equivalence
to the CHSH inequality for certain classes of two-qubit states. Yet, despite these
similarities, the criterion is not itself a non-locality measure. We also consider
entanglement detection in bound entangled states.'
article_type: original
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Hermann
full_name: Kampermann, Hermann
last_name: Kampermann
- first_name: Dagmar
full_name: Bru{\ss}, Dagmar
last_name: Bru{\ss}
citation:
ama: Gharibian S, Kampermann H, Bru{\ss} D. On global effects caused by locally
noneffective unitary operations. Quantum Information & Computation.
2009;9(11):1013-1029.
apa: Gharibian, S., Kampermann, H., & Bru{\ss}, D. (2009). On global effects
caused by locally noneffective unitary operations. Quantum Information &
Computation, 9(11), 1013–1029.
bibtex: '@article{Gharibian_Kampermann_Bru{\ss}_2009, title={On global effects caused
by locally noneffective unitary operations}, volume={9}, number={11}, journal={Quantum
Information & Computation}, author={Gharibian, Sevag and Kampermann, Hermann
and Bru{\ss}, Dagmar}, year={2009}, pages={1013–1029} }'
chicago: 'Gharibian, Sevag, Hermann Kampermann, and Dagmar Bru{\ss}. “On Global
Effects Caused by Locally Noneffective Unitary Operations.” Quantum Information
& Computation 9, no. 11 (2009): 1013–29.'
ieee: S. Gharibian, H. Kampermann, and D. Bru{\ss}, “On global effects caused by
locally noneffective unitary operations,” Quantum Information & Computation,
vol. 9, no. 11, pp. 1013–1029, 2009.
mla: Gharibian, Sevag, et al. “On Global Effects Caused by Locally Noneffective
Unitary Operations.” Quantum Information & Computation, vol. 9, no.
11, 2009, pp. 1013–29.
short: S. Gharibian, H. Kampermann, D. Bru{\ss}, Quantum Information & Computation
9 (2009) 1013–1029.
date_created: 2019-03-01T12:12:13Z
date_updated: 2023-02-28T11:04:50Z
department:
- _id: '623'
- _id: '7'
extern: '1'
external_id:
arxiv:
- '0809.4469'
intvolume: ' 9'
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0809.4469
oa: '1'
page: 1013-1029
publication: Quantum Information & Computation
publication_status: published
status: public
title: On global effects caused by locally noneffective unitary operations
type: journal_article
user_id: '71541'
volume: 9
year: '2009'
...
---
_id: '8181'
abstract:
- lang: eng
text: We investigate signatures of non-classicality in quantum states, in particular,
those involved in the DQC1 model of mixed-state quantum computation [Phys. Rev.
Lett. 81, 5672 (1998)]. To do so, we consider two known non-classicality criteria.
The first quantifies disturbance of a quantum state under locally noneffective
unitary operations (LNU), which are local unitaries acting invariantly on a subsystem.
The second quantifies measurement induced disturbance (MID) in the eigenbasis
of the reduced density matrices. We study the role of both figures of non-classicality
in the exponential speedup of the DQC1 model and compare them vis-a-vis the interpretation
provided in terms of quantum discord. In particular, we prove that a non-zero
quantum discord implies a non-zero shift under LNUs. We also use the MID measure
to study the locking of classical correlations [Phys. Rev. Lett. 92, 067902 (2004)]
using two mutually unbiased bases (MUB). We find the MID measure to exactly correspond
to the number of locked bits of correlation. For three or more MUBs, it predicts
the possibility of superior locking effects.
article_type: original
author:
- first_name: Animesh
full_name: Datta, Animesh
last_name: Datta
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
citation:
ama: Datta A, Gharibian S. Signatures of nonclassicality in mixed-state quantum
computation. Physical Review A. 2009;79(4). doi:10.1103/physreva.79.042325
apa: Datta, A., & Gharibian, S. (2009). Signatures of nonclassicality in mixed-state
quantum computation. Physical Review A, 79(4). https://doi.org/10.1103/physreva.79.042325
bibtex: '@article{Datta_Gharibian_2009, title={Signatures of nonclassicality in
mixed-state quantum computation}, volume={79}, DOI={10.1103/physreva.79.042325},
number={4}, journal={Physical Review A}, publisher={American Physical Society
(APS)}, author={Datta, Animesh and Gharibian, Sevag}, year={2009} }'
chicago: Datta, Animesh, and Sevag Gharibian. “Signatures of Nonclassicality in
Mixed-State Quantum Computation.” Physical Review A 79, no. 4 (2009). https://doi.org/10.1103/physreva.79.042325.
ieee: 'A. Datta and S. Gharibian, “Signatures of nonclassicality in mixed-state
quantum computation,” Physical Review A, vol. 79, no. 4, 2009, doi: 10.1103/physreva.79.042325.'
mla: Datta, Animesh, and Sevag Gharibian. “Signatures of Nonclassicality in Mixed-State
Quantum Computation.” Physical Review A, vol. 79, no. 4, American Physical
Society (APS), 2009, doi:10.1103/physreva.79.042325.
short: A. Datta, S. Gharibian, Physical Review A 79 (2009).
date_created: 2019-03-01T12:12:58Z
date_updated: 2023-02-28T11:05:02Z
department:
- _id: '623'
- _id: '7'
doi: 10.1103/physreva.79.042325
extern: '1'
external_id:
arxiv:
- '0811.4003'
intvolume: ' 79'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0811.4003
oa: '1'
publication: Physical Review A
publication_identifier:
issn:
- 1050-2947
- 1094-1622
publication_status: published
publisher: American Physical Society (APS)
status: public
title: Signatures of nonclassicality in mixed-state quantum computation
type: journal_article
user_id: '71541'
volume: 79
year: '2009'
...
---
_id: '2350'
abstract:
- lang: eng
text: 'Mapping applications that consist of a collection of cores to FPGA accelerators
and optimizing their performance is a challenging task in high performance reconfigurable
computing. We present IMORC, an architectural template and highly versatile on-chip
interconnect. IMORC links provide asynchronous FIFOs and bitwidth conversion which
allows for flexibly composing accelerators from cores running at full speed within
their own clock domains, thus facilitating the re-use of cores and portability.
Further, IMORC inserts performance counters for monitoring runtime data. In this
paper, we first introduce the IMORC architectural template and the on-chip interconnect,
and then demonstrate IMORC on the example of accelerating the k-th nearest neighbor
thinning problem on an XD1000 reconfigurable computing system. Using IMORC''s
monitoring infrastructure, we gain insights into the data-dependent behavior of
the application which, in turn, allow for optimizing the accelerator. '
author:
- first_name: Tobias
full_name: Schumacher, Tobias
last_name: Schumacher
- 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
citation:
ama: 'Schumacher T, Plessl C, Platzner M. IMORC: Application Mapping, Monitoring
and Optimization for High-Performance Reconfigurable Computing. In: Proc. Int.
Symp. on Field-Programmable Custom Computing Machines (FCCM). IEEE Computer
Society; 2009:275-278. doi:10.1109/FCCM.2009.25'
apa: 'Schumacher, T., Plessl, C., & Platzner, M. (2009). IMORC: Application
Mapping, Monitoring and Optimization for High-Performance Reconfigurable Computing.
Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM),
275–278. https://doi.org/10.1109/FCCM.2009.25'
bibtex: '@inproceedings{Schumacher_Plessl_Platzner_2009, title={IMORC: Application
Mapping, Monitoring and Optimization for High-Performance Reconfigurable Computing},
DOI={10.1109/FCCM.2009.25},
booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)},
publisher={IEEE Computer Society}, author={Schumacher, Tobias and Plessl, Christian
and Platzner, Marco}, year={2009}, pages={275–278} }'
chicago: 'Schumacher, Tobias, Christian Plessl, and Marco Platzner. “IMORC: Application
Mapping, Monitoring and Optimization for High-Performance Reconfigurable Computing.”
In Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM),
275–78. IEEE Computer Society, 2009. https://doi.org/10.1109/FCCM.2009.25.'
ieee: 'T. Schumacher, C. Plessl, and M. Platzner, “IMORC: Application Mapping, Monitoring
and Optimization for High-Performance Reconfigurable Computing,” in Proc. Int.
Symp. on Field-Programmable Custom Computing Machines (FCCM), 2009, pp. 275–278,
doi: 10.1109/FCCM.2009.25.'
mla: 'Schumacher, Tobias, et al. “IMORC: Application Mapping, Monitoring and Optimization
for High-Performance Reconfigurable Computing.” Proc. Int. Symp. on Field-Programmable
Custom Computing Machines (FCCM), IEEE Computer Society, 2009, pp. 275–78,
doi:10.1109/FCCM.2009.25.'
short: 'T. Schumacher, C. Plessl, M. Platzner, in: Proc. Int. Symp. on Field-Programmable
Custom Computing Machines (FCCM), IEEE Computer Society, 2009, pp. 275–278.'
date_created: 2018-04-16T15:05:52Z
date_updated: 2023-09-26T13:51:44Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/FCCM.2009.25
keyword:
- IMORC
- interconnect
- performance
language:
- iso: eng
page: 275-278
publication: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
publication_identifier:
isbn:
- 978-1-4244-4450-2
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: 'IMORC: Application Mapping, Monitoring and Optimization for High-Performance
Reconfigurable Computing'
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2262'
abstract:
- lang: eng
text: 'In this work we present EvoCache, a novel approach for implementing application-specific
caches. The key innovation of EvoCache is to make the function that maps memory
addresses from the CPU address space to cache indices programmable. We support
arbitrary Boolean mapping functions that are implemented within a small reconfigurable
logic fabric. For finding suitable cache mapping functions we rely on techniques
from the evolvable hardware domain and utilize an evolutionary optimization procedure.
We evaluate the use of EvoCache in an embedded processor for two specific applications
(JPEG and BZIP2 compression) with respect to execution time, cache miss rate and
energy consumption. We show that the evolvable hardware approach for optimizing
the cache functions not only significantly improves the cache performance for
the training data used during optimization, but that the evolved mapping functions
generalize very well. Compared to a conventional cache architecture, EvoCache
applied to test data achieves a reduction in execution time of up to 14.31% for
JPEG (10.98% for BZIP2), and in energy consumption by 16.43% for JPEG (10.70%
for BZIP2). We also discuss the integration of EvoCache into the operating system
and show that the area and delay overheads introduced by EvoCache are acceptable. '
author:
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- 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
citation:
ama: 'Kaufmann P, Plessl C, Platzner M. EvoCaches: Application-specific Adaptation
of Cache Mapping. In: Proc. NASA/ESA Conference on Adaptive Hardware and Systems
(AHS). IEEE Computer Society; 2009:11-18.'
apa: 'Kaufmann, P., Plessl, C., & Platzner, M. (2009). EvoCaches: Application-specific
Adaptation of Cache Mapping. Proc. NASA/ESA Conference on Adaptive Hardware
and Systems (AHS), 11–18.'
bibtex: '@inproceedings{Kaufmann_Plessl_Platzner_2009, place={Los Alamitos, CA,
USA}, title={EvoCaches: Application-specific Adaptation of Cache Mapping}, booktitle={Proc.
NASA/ESA Conference on Adaptive Hardware and Systems (AHS)}, publisher={IEEE Computer
Society}, author={Kaufmann, Paul and Plessl, Christian and Platzner, Marco}, year={2009},
pages={11–18} }'
chicago: 'Kaufmann, Paul, Christian Plessl, and Marco Platzner. “EvoCaches: Application-Specific
Adaptation of Cache Mapping.” In Proc. NASA/ESA Conference on Adaptive Hardware
and Systems (AHS), 11–18. Los Alamitos, CA, USA: IEEE Computer Society, 2009.'
ieee: 'P. Kaufmann, C. Plessl, and M. Platzner, “EvoCaches: Application-specific
Adaptation of Cache Mapping,” in Proc. NASA/ESA Conference on Adaptive Hardware
and Systems (AHS), 2009, pp. 11–18.'
mla: 'Kaufmann, Paul, et al. “EvoCaches: Application-Specific Adaptation of Cache
Mapping.” Proc. NASA/ESA Conference on Adaptive Hardware and Systems (AHS),
IEEE Computer Society, 2009, pp. 11–18.'
short: 'P. Kaufmann, C. Plessl, M. Platzner, in: Proc. NASA/ESA Conference on Adaptive
Hardware and Systems (AHS), IEEE Computer Society, Los Alamitos, CA, USA, 2009,
pp. 11–18.'
date_created: 2018-04-06T15:18:24Z
date_updated: 2023-09-26T13:53:11Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
keyword:
- EvoCache
- evolvable hardware
- computer architecture
language:
- iso: eng
page: 11-18
place: Los Alamitos, CA, USA
publication: Proc. NASA/ESA Conference on Adaptive Hardware and Systems (AHS)
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: 'EvoCaches: Application-specific Adaptation of Cache Mapping'
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2352'
author:
- first_name: Jan
full_name: Beutel, Jan
last_name: Beutel
- first_name: Stephan
full_name: Gruber, Stephan
last_name: Gruber
- first_name: Andi
full_name: Hasler, Andi
last_name: Hasler
- first_name: Roman
full_name: Lim, Roman
last_name: Lim
- first_name: Andreas
full_name: Meier, Andreas
last_name: Meier
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Igor
full_name: Talzi, Igor
last_name: Talzi
- first_name: Lothar
full_name: Thiele, Lothar
last_name: Thiele
- first_name: Christian
full_name: Tschudin, Christian
last_name: Tschudin
- first_name: Matthias
full_name: Woehrle, Matthias
last_name: Woehrle
- first_name: Mustafa
full_name: Yuecel, Mustafa
last_name: Yuecel
citation:
ama: 'Beutel J, Gruber S, Hasler A, et al. PermaDAQ: A Scientific Instrument for
Precision Sensing and Data Recovery in Environmental Extremes. In: Proc. Int.
Conf. on Information Processing in Sensor Networks (IPSN). IEEE Computer Society;
2009:265-276.'
apa: 'Beutel, J., Gruber, S., Hasler, A., Lim, R., Meier, A., Plessl, C., Talzi,
I., Thiele, L., Tschudin, C., Woehrle, M., & Yuecel, M. (2009). PermaDAQ:
A Scientific Instrument for Precision Sensing and Data Recovery in Environmental
Extremes. Proc. Int. Conf. on Information Processing in Sensor Networks (IPSN),
265–276.'
bibtex: '@inproceedings{Beutel_Gruber_Hasler_Lim_Meier_Plessl_Talzi_Thiele_Tschudin_Woehrle_et
al._2009, place={Washington, DC, USA}, title={PermaDAQ: A Scientific Instrument
for Precision Sensing and Data Recovery in Environmental Extremes}, booktitle={Proc.
Int. Conf. on Information Processing in Sensor Networks (IPSN)}, publisher={IEEE
Computer Society}, author={Beutel, Jan and Gruber, Stephan and Hasler, Andi and
Lim, Roman and Meier, Andreas and Plessl, Christian and Talzi, Igor and Thiele,
Lothar and Tschudin, Christian and Woehrle, Matthias and et al.}, year={2009},
pages={265–276} }'
chicago: 'Beutel, Jan, Stephan Gruber, Andi Hasler, Roman Lim, Andreas Meier, Christian
Plessl, Igor Talzi, et al. “PermaDAQ: A Scientific Instrument for Precision Sensing
and Data Recovery in Environmental Extremes.” In Proc. Int. Conf. on Information
Processing in Sensor Networks (IPSN), 265–76. Washington, DC, USA: IEEE Computer
Society, 2009.'
ieee: 'J. Beutel et al., “PermaDAQ: A Scientific Instrument for Precision
Sensing and Data Recovery in Environmental Extremes,” in Proc. Int. Conf. on
Information Processing in Sensor Networks (IPSN), 2009, pp. 265–276.'
mla: 'Beutel, Jan, et al. “PermaDAQ: A Scientific Instrument for Precision Sensing
and Data Recovery in Environmental Extremes.” Proc. Int. Conf. on Information
Processing in Sensor Networks (IPSN), IEEE Computer Society, 2009, pp. 265–76.'
short: 'J. Beutel, S. Gruber, A. Hasler, R. Lim, A. Meier, C. Plessl, I. Talzi,
L. Thiele, C. Tschudin, M. Woehrle, M. Yuecel, in: Proc. Int. Conf. on Information
Processing in Sensor Networks (IPSN), IEEE Computer Society, Washington, DC, USA,
2009, pp. 265–276.'
date_created: 2018-04-16T15:08:07Z
date_updated: 2023-09-26T13:52:01Z
department:
- _id: '27'
- _id: '518'
extern: '1'
keyword:
- WSN
- PermaSense
language:
- iso: eng
page: 265-276
place: Washington, DC, USA
publication: Proc. Int. Conf. on Information Processing in Sensor Networks (IPSN)
publication_identifier:
isbn:
- 978-1-4244-5108-1
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: 'PermaDAQ: A Scientific Instrument for Precision Sensing and Data Recovery
in Environmental Extremes'
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2238'
author:
- first_name: Tobias
full_name: Schumacher, Tobias
last_name: Schumacher
- first_name: Tim
full_name: Süß, Tim
last_name: Süß
- 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
citation:
ama: 'Schumacher T, Süß T, Plessl C, Platzner M. Communication Performance Characterization
for Reconfigurable Accelerator Design on the XD1000. In: Proc. Int. Conf. on
ReConFigurable Computing and FPGAs (ReConFig). IEEE Computer Society; 2009:119-124.
doi:10.1109/ReConFig.2009.32'
apa: Schumacher, T., Süß, T., Plessl, C., & Platzner, M. (2009). Communication
Performance Characterization for Reconfigurable Accelerator Design on the XD1000.
Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig), 119–124.
https://doi.org/10.1109/ReConFig.2009.32
bibtex: '@inproceedings{Schumacher_Süß_Plessl_Platzner_2009, place={Los Alamitos,
CA, USA}, title={Communication Performance Characterization for Reconfigurable
Accelerator Design on the XD1000}, DOI={10.1109/ReConFig.2009.32},
booktitle={Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)},
publisher={IEEE Computer Society}, author={Schumacher, Tobias and Süß, Tim and
Plessl, Christian and Platzner, Marco}, year={2009}, pages={119–124} }'
chicago: 'Schumacher, Tobias, Tim Süß, Christian Plessl, and Marco Platzner. “Communication
Performance Characterization for Reconfigurable Accelerator Design on the XD1000.”
In Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig), 119–24.
Los Alamitos, CA, USA: IEEE Computer Society, 2009. https://doi.org/10.1109/ReConFig.2009.32.'
ieee: 'T. Schumacher, T. Süß, C. Plessl, and M. Platzner, “Communication Performance
Characterization for Reconfigurable Accelerator Design on the XD1000,” in Proc.
Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig), 2009, pp. 119–124,
doi: 10.1109/ReConFig.2009.32.'
mla: Schumacher, Tobias, et al. “Communication Performance Characterization for
Reconfigurable Accelerator Design on the XD1000.” Proc. Int. Conf. on ReConFigurable
Computing and FPGAs (ReConFig), IEEE Computer Society, 2009, pp. 119–24, doi:10.1109/ReConFig.2009.32.
short: 'T. Schumacher, T. Süß, C. Plessl, M. Platzner, in: Proc. Int. Conf. on ReConFigurable
Computing and FPGAs (ReConFig), IEEE Computer Society, Los Alamitos, CA, USA,
2009, pp. 119–124.'
date_created: 2018-04-05T17:11:28Z
date_updated: 2023-09-26T13:52:32Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2009.32
keyword:
- IMORC
- graphics
language:
- iso: eng
page: 119-124
place: Los Alamitos, CA, USA
publication: Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)
publication_identifier:
isbn:
- 978-0-7695-3917-1
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: Communication Performance Characterization for Reconfigurable Accelerator Design
on the XD1000
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2261'
author:
- first_name: Tobias
full_name: Schumacher, Tobias
last_name: Schumacher
- 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
citation:
ama: 'Schumacher T, Plessl C, Platzner M. An Accelerator for k-th Nearest Neighbor
Thinning Based on the IMORC Infrastructure. In: Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL). IEEE; 2009:338-344.'
apa: Schumacher, T., Plessl, C., & Platzner, M. (2009). An Accelerator for k-th
Nearest Neighbor Thinning Based on the IMORC Infrastructure. Proc. Int. Conf.
on Field Programmable Logic and Applications (FPL), 338–344.
bibtex: '@inproceedings{Schumacher_Plessl_Platzner_2009, title={An Accelerator for
k-th Nearest Neighbor Thinning Based on the IMORC Infrastructure}, booktitle={Proc.
Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE},
author={Schumacher, Tobias and Plessl, Christian and Platzner, Marco}, year={2009},
pages={338–344} }'
chicago: Schumacher, Tobias, Christian Plessl, and Marco Platzner. “An Accelerator
for K-Th Nearest Neighbor Thinning Based on the IMORC Infrastructure.” In Proc.
Int. Conf. on Field Programmable Logic and Applications (FPL), 338–44. IEEE,
2009.
ieee: T. Schumacher, C. Plessl, and M. Platzner, “An Accelerator for k-th Nearest
Neighbor Thinning Based on the IMORC Infrastructure,” in Proc. Int. Conf. on
Field Programmable Logic and Applications (FPL), 2009, pp. 338–344.
mla: Schumacher, Tobias, et al. “An Accelerator for K-Th Nearest Neighbor Thinning
Based on the IMORC Infrastructure.” Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL), IEEE, 2009, pp. 338–44.
short: 'T. Schumacher, C. Plessl, M. Platzner, in: Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL), IEEE, 2009, pp. 338–344.'
date_created: 2018-04-06T15:15:47Z
date_updated: 2023-09-26T13:52:52Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
keyword:
- IMORC
- NOC
- KNN
- accelerator
language:
- iso: eng
page: 338-344
publication: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)
publication_identifier:
isbn:
- 978-1-4244-3892-1
issn:
- 1946-1488
publisher: IEEE
quality_controlled: '1'
status: public
title: An Accelerator for k-th Nearest Neighbor Thinning Based on the IMORC Infrastructure
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2263'
abstract:
- lang: eng
text: 'In this paper, we introduce the Woolcano reconfigurable processor architecture.
The architecture is based on the Xilinx Virtex-4 FX FPGA and leverages the Auxiliary
Processing Unit (APU) as well as the partial reconfiguration capabilities to provide
dynamically reconfigurable custom instructions. We also present a hardware tool
flow that automatically translates software functions into custom instructions
and a software tool flow that creates binaries using these instructions. While
previous research on processors with reconfigurable functional units has been
performed predominantly with simulation, the Woolcano architecture allows for
exploring dynamic instruction set extension with commercially available hardware.
Finally, we present a case study demonstrating a custom floating-point instruction
generated with our approach, which achieves a 40x speedup over software-emulated
floating-point operations and a 21% speedup over the Xilinx hardware floating-point
unit. '
author:
- first_name: Mariusz
full_name: Grad, Mariusz
last_name: Grad
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Grad M, Plessl C. Woolcano: An Architecture and Tool Flow for Dynamic Instruction
Set Extension on Xilinx Virtex-4 FX. In: Proc. Int. Conf. on Engineering of
Reconfigurable Systems and Algorithms (ERSA). CSREA Press; 2009:319-322.'
apa: 'Grad, M., & Plessl, C. (2009). Woolcano: An Architecture and Tool Flow
for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX. Proc. Int. Conf.
on Engineering of Reconfigurable Systems and Algorithms (ERSA), 319–322.'
bibtex: '@inproceedings{Grad_Plessl_2009, place={USA}, title={Woolcano: An Architecture
and Tool Flow for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX}, booktitle={Proc.
Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA
Press}, author={Grad, Mariusz and Plessl, Christian}, year={2009}, pages={319–322}
}'
chicago: 'Grad, Mariusz, and Christian Plessl. “Woolcano: An Architecture and Tool
Flow for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX.” In Proc.
Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA),
319–22. USA: CSREA Press, 2009.'
ieee: 'M. Grad and C. Plessl, “Woolcano: An Architecture and Tool Flow for Dynamic
Instruction Set Extension on Xilinx Virtex-4 FX,” in Proc. Int. Conf. on Engineering
of Reconfigurable Systems and Algorithms (ERSA), 2009, pp. 319–322.'
mla: 'Grad, Mariusz, and Christian Plessl. “Woolcano: An Architecture and Tool Flow
for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX.” Proc. Int. Conf.
on Engineering of Reconfigurable Systems and Algorithms (ERSA), CSREA Press,
2009, pp. 319–22.'
short: 'M. Grad, C. Plessl, in: Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA), CSREA Press, USA, 2009, pp. 319–322.'
date_created: 2018-04-06T15:19:51Z
date_updated: 2023-09-26T13:53:30Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
language:
- iso: eng
page: 319-322
place: USA
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA)
publication_identifier:
isbn:
- 1-60132-101-5
publisher: CSREA Press
quality_controlled: '1'
status: public
title: 'Woolcano: An Architecture and Tool Flow for Dynamic Instruction Set Extension
on Xilinx Virtex-4 FX'
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '60468'
author:
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: 'Campen M. A Framework for Geometry Processing based on Hybrid Surface Representations.
In: Porada L, ed. Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress
27. Und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
in Bonn. Vol S-8. LNI. GI; 2009:219–222.'
apa: 'Campen, M. (2009). A Framework for Geometry Processing based on Hybrid Surface
Representations. In L. Porada (Ed.), Informatiktage 2009 - Fachwissenschaftlicher
Informatik-Kongress 27. und 28. März 2009, B-IT Bonn-Aachen International Center
for Information Technology in Bonn: Vol. S-8 (pp. 219–222). GI.'
bibtex: '@inproceedings{Campen_2009, series={LNI}, title={A Framework for Geometry
Processing based on Hybrid Surface Representations}, volume={S-8}, booktitle={Informatiktage
2009 - Fachwissenschaftlicher Informatik-Kongress 27. und 28. März 2009, B-IT
Bonn-Aachen International Center for Information Technology in Bonn}, publisher={GI},
author={Campen, Marcel}, editor={Porada, Ludger}, year={2009}, pages={219–222},
collection={LNI} }'
chicago: Campen, Marcel. “A Framework for Geometry Processing Based on Hybrid Surface
Representations.” In Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress
27. Und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
in Bonn, edited by Ludger Porada, S-8:219–222. LNI. GI, 2009.
ieee: M. Campen, “A Framework for Geometry Processing based on Hybrid Surface Representations,”
in Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress 27. und
28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
in Bonn, 2009, vol. S-8, pp. 219–222.
mla: Campen, Marcel. “A Framework for Geometry Processing Based on Hybrid Surface
Representations.” Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress
27. Und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
in Bonn, edited by Ludger Porada, vol. S-8, GI, 2009, pp. 219–222.
short: 'M. Campen, in: L. Porada (Ed.), Informatiktage 2009 - Fachwissenschaftlicher
Informatik-Kongress 27. Und 28. März 2009, B-IT Bonn-Aachen International Center
for Information Technology in Bonn, GI, 2009, pp. 219–222.'
date_created: 2025-06-30T09:01:44Z
date_updated: 2025-07-14T12:35:02Z
department:
- _id: '969'
editor:
- first_name: Ludger
full_name: Porada, Ludger
last_name: Porada
extern: '1'
language:
- iso: eng
page: 219–222
publication: Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress 27.
und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
in Bonn
publisher: GI
series_title: LNI
status: public
title: A Framework for Geometry Processing based on Hybrid Surface Representations
type: conference
user_id: '114904'
volume: S-8
year: '2009'
...
---
_id: '60467'
author:
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Campen M. Ein Framework für Geometrieverarbeitung basierend auf hybriden Oberflächendarstellungen.
Informatik-Spektrum. 2009;33(1):66-69. doi:10.1007/s00287-009-0371-4
apa: Campen, M. (2009). Ein Framework für Geometrieverarbeitung basierend auf hybriden
Oberflächendarstellungen. Informatik-Spektrum, 33(1), 66–69. https://doi.org/10.1007/s00287-009-0371-4
bibtex: '@article{Campen_2009, title={Ein Framework für Geometrieverarbeitung basierend
auf hybriden Oberflächendarstellungen}, volume={33}, DOI={10.1007/s00287-009-0371-4},
number={1}, journal={Informatik-Spektrum}, publisher={Springer Science and Business
Media LLC}, author={Campen, Marcel}, year={2009}, pages={66–69} }'
chicago: 'Campen, Marcel. “Ein Framework für Geometrieverarbeitung basierend auf
hybriden Oberflächendarstellungen.” Informatik-Spektrum 33, no. 1 (2009):
66–69. https://doi.org/10.1007/s00287-009-0371-4.'
ieee: 'M. Campen, “Ein Framework für Geometrieverarbeitung basierend auf hybriden
Oberflächendarstellungen,” Informatik-Spektrum, vol. 33, no. 1, pp. 66–69,
2009, doi: 10.1007/s00287-009-0371-4.'
mla: Campen, Marcel. “Ein Framework für Geometrieverarbeitung basierend auf hybriden
Oberflächendarstellungen.” Informatik-Spektrum, vol. 33, no. 1, Springer
Science and Business Media LLC, 2009, pp. 66–69, doi:10.1007/s00287-009-0371-4.
short: M. Campen, Informatik-Spektrum 33 (2009) 66–69.
date_created: 2025-06-30T08:59:02Z
date_updated: 2025-07-14T12:35:26Z
department:
- _id: '969'
doi: 10.1007/s00287-009-0371-4
extern: '1'
intvolume: ' 33'
issue: '1'
language:
- iso: ger
page: 66-69
publication: Informatik-Spektrum
publication_identifier:
issn:
- 0170-6012
- 1432-122X
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Ein Framework für Geometrieverarbeitung basierend auf hybriden Oberflächendarstellungen
type: journal_article
user_id: '117512'
volume: 33
year: '2009'
...
---
_id: '2513'
author:
- first_name: Thorsten
full_name: Biermann, Thorsten
last_name: Biermann
- first_name: Christian
full_name: Dannewitz, Christian
last_name: Dannewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Biermann T, Dannewitz C, Karl H. Extended Results on an Adaptive Resource/Performance
Trade-Off for Resolving Complex Queries in P2P Networks.; 2008.
apa: Biermann, T., Dannewitz, C., & Karl, H. (2008). Extended Results on
an Adaptive Resource/Performance Trade-Off for Resolving Complex Queries in P2P
Networks.
bibtex: '@book{Biermann_Dannewitz_Karl_2008, title={Extended Results on an Adaptive
Resource/Performance Trade-Off for Resolving Complex Queries in P2P Networks},
author={Biermann, Thorsten and Dannewitz, Christian and Karl, Holger}, year={2008}
}'
chicago: Biermann, Thorsten, Christian Dannewitz, and Holger Karl. Extended Results
on an Adaptive Resource/Performance Trade-Off for Resolving Complex Queries in
P2P Networks, 2008.
ieee: T. Biermann, C. Dannewitz, and H. Karl, Extended Results on an Adaptive
Resource/Performance Trade-Off for Resolving Complex Queries in P2P Networks.
2008.
mla: Biermann, Thorsten, et al. Extended Results on an Adaptive Resource/Performance
Trade-Off for Resolving Complex Queries in P2P Networks. 2008.
short: T. Biermann, C. Dannewitz, H. Karl, Extended Results on an Adaptive Resource/Performance
Trade-Off for Resolving Complex Queries in P2P Networks, 2008.
date_created: 2018-04-26T10:46:08Z
date_updated: 2022-01-06T06:56:53Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-26T10:45:25Z
date_updated: 2018-04-26T10:45:25Z
file_id: '2514'
file_name: Optimizing.pdf
file_size: 230623
relation: main_file
success: 1
file_date_updated: 2018-04-26T10:45:25Z
has_accepted_license: '1'
status: public
title: Extended Results on an Adaptive Resource/Performance Trade-Off for Resolving
Complex Queries in P2P Networks
type: report
user_id: '15572'
year: '2008'
...
---
_id: '19615'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: Schomaker G. Distributed Resource Allocation and Management in Heterogeneous
Networks. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2008.
apa: Schomaker, G. (2008). Distributed Resource Allocation and Management in
Heterogeneous Networks (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn.
bibtex: '@book{Schomaker_2008, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Distributed Resource Allocation and Management in Heterogeneous
Networks}, volume={259}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Schomaker, Gunnar}, year={2008}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Schomaker, Gunnar. Distributed Resource Allocation and Management in
Heterogeneous Networks. Vol. 259. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
ieee: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
mla: Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous
Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
short: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
date_created: 2020-09-22T08:10:41Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 259'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-78-1
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090114013
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: Distributed Resource Allocation and Management in Heterogeneous Networks
type: dissertation
user_id: '5786'
volume: 259
year: '2008'
...
---
_id: '19686'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
citation:
ama: 'Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
; 2008. doi:10.1007/978-3-540-70575-8_66'
apa: Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
https://doi.org/10.1007/978-3-540-70575-8_66
bibtex: '@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing
Problem}, DOI={10.1007/978-3-540-70575-8_66},
booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }'
chicago: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In
Proceedings of the 35th InternationalColloquium on Automata, Languages and
Programming (ICALP), 2008. https://doi.org/10.1007/978-3-540-70575-8_66.
ieee: P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008.
mla: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008, doi:10.1007/978-3-540-70575-8_66.
short: 'P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata,
Languages and Programming (ICALP), 2008.'
date_created: 2020-09-25T09:45:40Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-70575-8_66
language:
- iso: eng
publication: Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)
publication_identifier:
isbn:
- '9783540705741'
- '9783540705758'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Uniform Budgets and the Envy-Free Pricing Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19687'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
- first_name: Moshe
full_name: Babaioff, Moshe
last_name: Babaioff
citation:
ama: 'Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange
Problems. In: Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT). Cham; 2008. doi:https://doi.org/10.1007/978-3-540-79309-0_9'
apa: Briest, P., Krysta, P., & Babaioff, M. (2008). On the Approximability of
Combinatorial Exchange Problems. In Proceedings of the 1st International Symposium
on Algorithmic Game Theory (SAGT). Cham. https://doi.org/10.1007/978-3-540-79309-0_9
bibtex: '@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the
Approximability of Combinatorial Exchange Problems}, DOI={https://doi.org/10.1007/978-3-540-79309-0_9},
booktitle={Proceedings of the 1st International Symposium on Algorithmic Game
Theory (SAGT)}, author={Briest, Patrick and Krysta, Piotr and Babaioff, Moshe},
year={2008} }'
chicago: Briest, Patrick, Piotr Krysta, and Moshe Babaioff. “On the Approximability
of Combinatorial Exchange Problems.” In Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT). Cham, 2008. https://doi.org/10.1007/978-3-540-79309-0_9.
ieee: P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial
Exchange Problems,” in Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT), 2008.
mla: Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.”
Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT),
2008, doi:https://doi.org/10.1007/978-3-540-79309-0_9.
short: 'P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.'
date_created: 2020-09-25T09:49:43Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: https://doi.org/10.1007/978-3-540-79309-0_9
language:
- iso: eng
place: Cham
publication: Proceedings of the 1st International Symposium on Algorithmic Game Theory
(SAGT)
publication_status: published
status: public
title: On the Approximability of Combinatorial Exchange Problems
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19688'
abstract:
- lang: eng
text: "We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria)
in normal form games, where the number of players is a small\r\nconstant. We consider
the approach of looking for solutions with constant\r\nsupport size. It is known
from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily
found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2.
In this paper we extend those results to the\r\nk-player case, and find that epsilon
= 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results
for the 2-player case may be used\r\nin order to slightly improve upon the epsilon
= 1-1/k obtained in the k-player\r\ncase."
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Paul W.
full_name: Goldberg, Paul W.
last_name: Goldberg
- first_name: Heiko
full_name: Roeglin, Heiko
last_name: Roeglin
citation:
ama: Briest P, Goldberg PW, Roeglin H. Approximate Equilibria in Games with Few
Players.; 2008.
apa: Briest, P., Goldberg, P. W., & Roeglin, H. (2008). Approximate Equilibria
in Games with Few Players.
bibtex: '@book{Briest_Goldberg_Roeglin_2008, title={Approximate Equilibria in Games
with Few Players}, author={Briest, Patrick and Goldberg, Paul W. and Roeglin,
Heiko}, year={2008} }'
chicago: Briest, Patrick, Paul W. Goldberg, and Heiko Roeglin. Approximate Equilibria
in Games with Few Players, 2008.
ieee: P. Briest, P. W. Goldberg, and H. Roeglin, Approximate Equilibria in Games
with Few Players. 2008.
mla: Briest, Patrick, et al. Approximate Equilibria in Games with Few Players.
2008.
short: P. Briest, P.W. Goldberg, H. Roeglin, Approximate Equilibria in Games with
Few Players, 2008.
date_created: 2020-09-25T09:52:57Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
external_id:
arxiv:
- '0804.4524 '
language:
- iso: eng
status: public
title: Approximate Equilibria in Games with Few Players
type: report
user_id: '15415'
year: '2008'
...
---
_id: '19812'
abstract:
- lang: eng
text: 'Modern peer-to-peer networks consist of several network layers and distributed
algorithms providing features like indexing, resource balancing, entry protocols,
security, anonymity, and cryptography. Since peer-to-peer networks are highly
dynamic, a fundamental task in the design of these networks is to provide high
connectivity. We propose a solution by distributed random link exchange algorithms
such that the overlay network can be a connected random graph or use a random
graph as backbone. Random graphs are expander graphs have logarithmic diameter,
high node connectivity, excellent communication properties, and are expander graphs
with high probability. In summary: they are an excellent choice to improve the
stability and robustness of a dynamic network.'
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: 'Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In:
The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.'
apa: Schindelhauer, C., & Mahlmann, P. (2008). Random Graphs for Peer-to-Peer
Overlays. The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, 222,
1–22.
bibtex: '@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer
Overlays}, number={222}, booktitle={The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer,
Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }'
chicago: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” In The European Integrated Project "Dynamically Evolving, Large
Scale Information Systems (DELIS), Proceedings of the Final Workshop, 1–22.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
ieee: C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,”
in The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.
mla: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, no. 222, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.
short: 'C. Schindelhauer, P. Mahlmann, in: The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.'
date_created: 2020-09-30T13:24:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '26'
issue: '222'
language:
- iso: eng
page: 1-22
publication: The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Random Graphs for Peer-to-Peer Overlays
type: conference
user_id: '5786'
year: '2008'
...
---
_id: '19813'
abstract:
- lang: eng
text: 'Autonomous robotic systems have been gaining the attention of research community
in mobile ad hoc network since the past few years. While motion cost and communications
cost constitute the primary energy consumers, each of them is investigated independently.
By taking into account the power consumption of both entities, the overall energy
efficiency of a system can be further improved. In this paper, the energy optimization
problem of radio communication and motion is examined. We consider a hybrid wireless network
that consists of a single autonomous mobile node and multiple relay nodes. The
mobile node interacts with the relays within its vicinity by continuously communicating
high-bandwidth data, e.g. triggered by a multimedia application like video surveillance.
The goal is to find the best path such that the energy consumption for both mobility
and communications is minimized. We introduce the Radio-Energy-Aware (REA) path
computation strategy by utilizing node mobility. Given the starting point, the
target point and the position of the relays, our simulation results show that
the proposed strategy improves the energy efficiency of mobile node compared to
the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. '
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Detours Save Energy in Mobile Wireless Networks.
In: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer;
2008. doi:10.1007/978-0-387-84839-6_6'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Detours Save Energy in Mobile
Wireless Networks. In MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008). Springer. https://doi.org/10.1007/978-0-387-84839-6_6'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Detours Save Energy in Mobile
Wireless Networks}, DOI={10.1007/978-0-387-84839-6_6},
booktitle={MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}, publisher={Springer},
author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in
Mobile Wireless Networks.” In MWCN’08: Proc. of IFIP Joint Conference on Mobile
Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008). Springer, 2008. https://doi.org/10.1007/978-0-387-84839-6_6.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,”
in MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile
Wireless Networks.” MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008), Springer, 2008, doi:10.1007/978-0-387-84839-6_6.'
short: 'C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference
on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008), Springer, 2008.'
date_created: 2020-09-30T13:27:54Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-0-387-84839-6_6
language:
- iso: eng
publication: 'MWCN''08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)'
publication_identifier:
isbn:
- '9780387848389'
- '9780387848396'
issn:
- 1571-5736
publication_status: published
publisher: Springer
status: public
title: Detours Save Energy in Mobile Wireless Networks
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19832'
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Energy-Efficient Distributed Target Tracking Using
Wireless Relay Robots. In: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008). ; 2008. doi:10.1007/978-3-642-00644-9_4'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Energy-Efficient Distributed Target
Tracking Using Wireless Relay Robots. In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008). https://doi.org/10.1007/978-3-642-00644-9_4'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots}, DOI={10.1007/978-3-642-00644-9_4},
booktitle={ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)}, author={Ooi, Chia Ching and Schindelhauer, Christian},
year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008. https://doi.org/10.1007/978-3-642-00644-9_4.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking
Using Wireless Relay Robots,” in ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008, doi:10.1007/978-3-642-00644-9_4.'
short: 'C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
date_created: 2020-10-01T10:14:06Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-3-642-00644-9_4
language:
- iso: eng
publication: 'ARS''08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)'
publication_identifier:
isbn:
- '9783642006432'
- '9783642006449'
publication_status: published
status: public
title: Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19950'
author:
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: Pietrzyk P. Lokale Strategien Zur Optimierung von Kommunikationsketten.;
2008.
apa: Pietrzyk, P. (2008). Lokale Strategien zur Optimierung von Kommunikationsketten.
bibtex: '@book{Pietrzyk_2008, title={Lokale Strategien zur Optimierung von Kommunikationsketten},
author={Pietrzyk, Peter}, year={2008} }'
chicago: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
ieee: P. Pietrzyk, Lokale Strategien zur Optimierung von Kommunikationsketten.
2008.
mla: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten.
2008.
short: P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
date_created: 2020-10-07T14:23:26Z
date_updated: 2022-01-06T06:54:16Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-10-07T14:22:49Z
date_updated: 2020-10-07T14:22:49Z
file_id: '19951'
file_name: pub-hni-3364.pdf
file_size: 638802
relation: main_file
success: 1
file_date_updated: 2020-10-07T14:22:49Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Lokale Strategien zur Optimierung von Kommunikationsketten
type: mastersthesis
user_id: '15415'
year: '2008'
...