---
_id: '19790'
abstract:
- lang: eng
text: The advances in Internet technology have led to tremendous improvements in
business, education, and science and have changed the way we think, live, and
communicate. Information exchange has become ubiquitous by the possibilities offered
through modern technologies. We are able to offer information 24 hours a day through
our web sites and can leave messages every time and from anywhere in the world.
This change in communication has led to new challenges. Enterprises have to deal
with an information amount that doubles every year. The technological foundation
to cope with this information explosion is given by Storage Area Networks (SANs),
which are able to connect a great number of storage systems over a fast interconnection
network. However, to be able to use the benefits of a SAN, an easy-to-use and
efficient management support has to be given to the storage administrator. In
this paper, we will suggest new storage management concepts and we will introduce
a new management environment that is able to significantly reduce management costs
and increases the performance and resource utilization of the given SAN infrastructure.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
- first_name: Ulrich
full_name: Rückert, Ulrich
last_name: Rückert
citation:
ama: 'Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M,
Rückert U. Storage Management as Means to cope with Exponential Information Growth.
In: Proceedings of SSGRR 2003. ; 2003.'
apa: Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek,
M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential
Information Growth. In Proceedings of SSGRR 2003.
bibtex: '@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003,
title={Storage Management as Means to cope with Exponential Information Growth},
booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel,
Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario
and Rückert, Ulrich}, year={2003} }'
chicago: Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André
Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to
Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003,
2003.
ieee: C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
and U. Rückert, “Storage Management as Means to cope with Exponential Information
Growth,” in Proceedings of SSGRR 2003, 2003.
mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential
Information Growth.” Proceedings of SSGRR 2003, 2003.
short: 'C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
U. Rückert, in: Proceedings of SSGRR 2003, 2003.'
date_created: 2020-09-30T12:04:14Z
date_updated: 2022-01-06T06:54:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '58'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-30T12:03:57Z
date_updated: 2020-09-30T12:03:57Z
file_id: '19793'
file_name: pub-hni-908.pdf
file_size: 499057
relation: main_file
success: 1
file_date_updated: 2020-09-30T12:03:57Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of SSGRR 2003
status: public
title: Storage Management as Means to cope with Exponential Information Growth
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19806'
abstract:
- lang: eng
text: We try to close the gap between theoretical investigations of wireless network
topologies and realistic wireless environments. For point-to-point communication,
we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the
SparsY-graph, and the SymmY-graph. We present distributed algorithms that can
be used to build up these graphs in time $O(log n)$ per node without the use of
any geo-graphical positioning system. Our algorithms are based only on local knowledge
and local decisions and make use of power control to establish communication links
with low energy-cost. We compare these algorithms with respect to congestion,
dilation, and energy. For congestion we introduce different measures that allow
us to investigate the difference between real-world wireless networks and models
for wireless communication at a high level of abstraction. For more realistic
simulations we extend our simulation environment SAHNE. We use a realistic transmission
model for directed communication that uses sector subdivision. Finally, our experimental
results show that our topologies and algorithms work well in a distributed environment
and we give some recommendations for the topology control based on our simulations.
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: 'Christian '
full_name: 'Schindelhauer, Christian '
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: M.
full_name: Grünewald, M.
last_name: Grünewald
citation:
ama: 'Rührup S, Schindelhauer C, Volbert K, Grünewald M. Performance of distributed
algorithms for topology control in wireless networks. In: Proceedings of the
International Parallel and Distributed Processing Symposium (IPDPS). ; 2003.
doi:10.1109/ipdps.2003.1213107'
apa: Rührup, S., Schindelhauer, C., Volbert, K., & Grünewald, M. (2003). Performance
of distributed algorithms for topology control in wireless networks. Proceedings
of the International Parallel and Distributed Processing Symposium (IPDPS).
https://doi.org/10.1109/ipdps.2003.1213107
bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_Grünewald_2003, title={Performance
of distributed algorithms for topology control in wireless networks}, DOI={10.1109/ipdps.2003.1213107},
booktitle={Proceedings of the International Parallel and Distributed Processing
Symposium (IPDPS)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert,
Klaus and Grünewald, M.}, year={2003} }'
chicago: Rührup, Stefan, Christian Schindelhauer, Klaus Volbert, and M. Grünewald.
“Performance of Distributed Algorithms for Topology Control in Wireless Networks.”
In Proceedings of the International Parallel and Distributed Processing Symposium
(IPDPS), 2003. https://doi.org/10.1109/ipdps.2003.1213107.
ieee: 'S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of
distributed algorithms for topology control in wireless networks,” 2003, doi:
10.1109/ipdps.2003.1213107.'
mla: Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology
Control in Wireless Networks.” Proceedings of the International Parallel and
Distributed Processing Symposium (IPDPS), 2003, doi:10.1109/ipdps.2003.1213107.
short: 'S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of
the International Parallel and Distributed Processing Symposium (IPDPS), 2003.'
date_created: 2020-09-30T12:51:22Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '58'
doi: 10.1109/ipdps.2003.1213107
language:
- iso: eng
publication: Proceedings of the International Parallel and Distributed Processing
Symposium (IPDPS)
publication_identifier:
isbn:
- '0769519261'
publication_status: published
status: public
title: Performance of distributed algorithms for topology control in wireless networks
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19828'
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: Mahlmann P. Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web.; 2003.
apa: Mahlmann, P. (2003). Implementierung und Vergleich von Verfahren zum Information
Retrieval im World Wide Web.
bibtex: '@book{Mahlmann_2003, title={Implementierung und Vergleich von Verfahren
zum Information Retrieval im World Wide Web}, author={Mahlmann, Peter}, year={2003}
}'
chicago: Mahlmann, Peter. Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web, 2003.
ieee: P. Mahlmann, Implementierung und Vergleich von Verfahren zum Information
Retrieval im World Wide Web. 2003.
mla: Mahlmann, Peter. Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web. 2003.
short: P. Mahlmann, Implementierung Und Vergleich von Verfahren Zum Information
Retrieval Im World Wide Web, 2003.
date_created: 2020-10-01T09:55:38Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Implementierung und Vergleich von Verfahren zum Information Retrieval im World
Wide Web
type: mastersthesis
user_id: '15415'
year: '2003'
...
---
_id: '19833'
abstract:
- lang: eng
text: Communication facilities are important in Robotics if several robots have
to work together. In this paper, we describe problems and solutions encountered
while designing an infrared-based communication device for the mini robot Khepera.
In contrast to traditional omnidirectional systems, it features directed, power-variable
transmission in eight directions at unit[23.4]kbps up to a range of unit[1m].
It can differentiate incoming data signals from interference from adjacent sectors
and can estimate their direction-of-arrival. We model the transmission over the
infrared channel and show how interference influences the reception of the data
signals. We also describe methods how to reduce these effects. We have tested
the performance of the resulted signal processing in a worst case scenario by
simulations and in experiments with a prototype implementation. The resulted module
is especially suited for experimental evaluation of ad hoc network protocols
and for position estimation.
author:
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Ulrich
full_name: Rückert, Ulrich
last_name: Rückert
citation:
ama: 'Volbert K, Grünewald M, Schindelhauer C, Rückert U. Directed power-variable
infrared communication for the mini robot Khepera. In: Proceedings of the 2nd
International Conference on Autonomous Minirobots for Research and Edutainment.
; 2003:113-122.'
apa: Volbert, K., Grünewald, M., Schindelhauer, C., & Rückert, U. (2003). Directed
power-variable infrared communication for the mini robot Khepera. In Proceedings
of the 2nd International Conference on Autonomous Minirobots for Research and
Edutainment (pp. 113–122).
bibtex: '@inproceedings{Volbert_Grünewald_Schindelhauer_Rückert_2003, title={Directed
power-variable infrared communication for the mini robot Khepera}, booktitle={Proceedings
of the 2nd International Conference on Autonomous Minirobots for Research and
Edutainment}, author={Volbert, Klaus and Grünewald, Matthias and Schindelhauer,
Christian and Rückert, Ulrich}, year={2003}, pages={113–122} }'
chicago: Volbert, Klaus, Matthias Grünewald, Christian Schindelhauer, and Ulrich
Rückert. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.”
In Proceedings of the 2nd International Conference on Autonomous Minirobots
for Research and Edutainment, 113–22, 2003.
ieee: K. Volbert, M. Grünewald, C. Schindelhauer, and U. Rückert, “Directed power-variable
infrared communication for the mini robot Khepera,” in Proceedings of the 2nd
International Conference on Autonomous Minirobots for Research and Edutainment,
2003, pp. 113–122.
mla: Volbert, Klaus, et al. “Directed Power-Variable Infrared Communication for
the Mini Robot Khepera.” Proceedings of the 2nd International Conference on
Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–22.
short: 'K. Volbert, M. Grünewald, C. Schindelhauer, U. Rückert, in: Proceedings
of the 2nd International Conference on Autonomous Minirobots for Research and
Edutainment, 2003, pp. 113–122.'
date_created: 2020-10-01T11:20:47Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '58'
language:
- iso: eng
page: 113-122
publication: Proceedings of the 2nd International Conference on Autonomous Minirobots
for Research and Edutainment
status: public
title: Directed power-variable infrared communication for the mini robot Khepera
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19874'
abstract:
- lang: eng
text: We present a novel framework for hierarchical collision detection that can
be applied to virtually all bounding volume (BV) hierarchies. It allows an application
to trade quality for speed. Our algorithm yields an estimation of the quality,
so that applications can specify the desired quality. In a timecritical system,
applications can specify the maximum time budget instead, and quantitatively assess
the quality of the results returned by the collision detection afterwards.
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Gabriel
full_name: Zachmann, Gabriel
last_name: Zachmann
citation:
ama: 'Klein J, Zachmann G. ADB-Trees: Controlling the Error of Time-Critical Collision
Detection. In: Proc. 8th International Fall Workshop Vision, Modeling, and
Visualization (VMV 2003). ; 2003:37-45.'
apa: 'Klein, J., & Zachmann, G. (2003). ADB-Trees: Controlling the Error of
Time-Critical Collision Detection. In Proc. 8th International Fall Workshop
Vision, Modeling, and Visualization (VMV 2003) (pp. 37–45).'
bibtex: '@inproceedings{Klein_Zachmann_2003, title={ADB-Trees: Controlling the Error
of Time-Critical Collision Detection}, booktitle={Proc. 8th International Fall
Workshop Vision, Modeling, and Visualization (VMV 2003)}, author={Klein, Jan and
Zachmann, Gabriel}, year={2003}, pages={37–45} }'
chicago: 'Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of
Time-Critical Collision Detection.” In Proc. 8th International Fall Workshop
Vision, Modeling, and Visualization (VMV 2003), 37–45, 2003.'
ieee: 'J. Klein and G. Zachmann, “ADB-Trees: Controlling the Error of Time-Critical
Collision Detection,” in Proc. 8th International Fall Workshop Vision, Modeling,
and Visualization (VMV 2003), 2003, pp. 37–45.'
mla: 'Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of Time-Critical
Collision Detection.” Proc. 8th International Fall Workshop Vision, Modeling,
and Visualization (VMV 2003), 2003, pp. 37–45.'
short: 'J. Klein, G. Zachmann, in: Proc. 8th International Fall Workshop Vision,
Modeling, and Visualization (VMV 2003), 2003, pp. 37–45.'
date_created: 2020-10-05T10:30:07Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 37-45
publication: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization
(VMV 2003)
status: public
title: 'ADB-Trees: Controlling the Error of Time-Critical Collision Detection'
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19900'
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Gabriel
full_name: ' Zachmann, Gabriel'
last_name: ' Zachmann'
citation:
ama: 'Klein J, Zachmann G. Time-Critical Collision Detection Using an Average-Case
Approach. In: Proc. ACM Symposium on Virtual Reality Software and Technology
(VRST 2003). ; 2003:22-31. doi:10.1145/1008653.1008660'
apa: Klein, J., & Zachmann, G. (2003). Time-Critical Collision Detection Using
an Average-Case Approach. In Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003) (pp. 22–31). https://doi.org/10.1145/1008653.1008660
bibtex: '@inproceedings{Klein_ Zachmann_2003, title={Time-Critical Collision Detection
Using an Average-Case Approach}, DOI={10.1145/1008653.1008660},
booktitle={ Proc. ACM Symposium on Virtual Reality Software and Technology (VRST
2003)}, author={Klein, Jan and Zachmann, Gabriel}, year={2003}, pages={22–31}
}'
chicago: Klein, Jan, and Gabriel Zachmann. “Time-Critical Collision Detection Using
an Average-Case Approach.” In Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003), 22–31, 2003. https://doi.org/10.1145/1008653.1008660.
ieee: J. Klein and G. Zachmann, “Time-Critical Collision Detection Using an Average-Case
Approach,” in Proc. ACM Symposium on Virtual Reality Software and Technology
(VRST 2003), 2003, pp. 22–31.
mla: Klein, Jan, and Gabriel Zachmann. “Time-Critical Collision Detection Using
an Average-Case Approach.” Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003), 2003, pp. 22–31, doi:10.1145/1008653.1008660.
short: 'J. Klein, G. Zachmann, in: Proc. ACM Symposium on Virtual Reality Software
and Technology (VRST 2003), 2003, pp. 22–31.'
date_created: 2020-10-06T08:31:35Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1145/1008653.1008660
language:
- iso: eng
page: 22-31
publication: ' Proc. ACM Symposium on Virtual Reality Software and Technology (VRST
2003)'
status: public
title: Time-Critical Collision Detection Using an Average-Case Approach
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19952'
abstract:
- lang: eng
text: Graph minors theory, developed by Robertson & Seymour, provides a list of
powerful theoretical results and tools. However, the wide spread opinion in Graph
Algorithms community about this theory is that it is mainly of theoretical importance.
The main purpose of this paper is to show how very deep min-max and duality theorems
from Graph Minors can be used to obtain essential speed-up to many known algorithms
on different domination problems.
author:
- first_name: Fedor V.
full_name: Fomin, Fedor V.
last_name: Fomin
- first_name: Dimitrios M.
full_name: Thilikos, Dimitrios M.
last_name: Thilikos
citation:
ama: 'Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and
Exponential Speed-Up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete
Algorithms (SODA 2003). ; 2003. doi:10.1137/s0097539702419649'
apa: 'Fomin, F. V., & Thilikos, D. M. (2003). Dominating Sets in Planar Graphs:
Branch-Width and Exponential Speed-Up. In Proceedings of the 14th ACM-SIAM
Symposium on Discrete Algorithms (SODA 2003). https://doi.org/10.1137/s0097539702419649'
bibtex: '@inproceedings{Fomin_Thilikos_2003, title={Dominating Sets in Planar Graphs:
Branch-Width and Exponential Speed-Up}, DOI={10.1137/s0097539702419649},
booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
2003)}, author={Fomin, Fedor V. and Thilikos, Dimitrios M.}, year={2003} }'
chicago: 'Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar
Graphs: Branch-Width and Exponential Speed-Up.” In Proceedings of the 14th
ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003. https://doi.org/10.1137/s0097539702419649.'
ieee: 'F. V. Fomin and D. M. Thilikos, “Dominating Sets in Planar Graphs: Branch-Width
and Exponential Speed-Up,” in Proceedings of the 14th ACM-SIAM Symposium on
Discrete Algorithms (SODA 2003), 2003.'
mla: 'Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs:
Branch-Width and Exponential Speed-Up.” Proceedings of the 14th ACM-SIAM Symposium
on Discrete Algorithms (SODA 2003), 2003, doi:10.1137/s0097539702419649.'
short: 'F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium
on Discrete Algorithms (SODA 2003), 2003.'
date_created: 2020-10-08T10:31:48Z
date_updated: 2022-01-06T06:54:16Z
department:
- _id: '63'
doi: 10.1137/s0097539702419649
language:
- iso: eng
publication: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA
2003)
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up'
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '2418'
abstract:
- lang: eng
text: ' This paper presents TKDM, a PC-based high-performance reconfigurable computing
environment. The TKDM hardware consists of an FPGA module that uses the DIMM (dual
inline memory module) bus for high-bandwidth and low-latency communication with
the host CPU. The system''s firmware is integrated with the Linux host operating
system and offers functions for data communication and FPGA reconfiguration. The
intended use of TKDM is that of a dynamically reconfigurable co-processor for
data streaming applications. The system''s firmware can be customized for specific
application domains to facilitate simple and easy-to-use programming interfaces. '
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Plessl C, Platzner M. TKDM – A Reconfigurable Co-processor in a PC’s Memory
Slot. In: Proc. Int. Conf. on Field Programmable Technology (ICFPT). IEEE
Computer Society; 2003:252-259. doi:10.1109/FPT.2003.1275755'
apa: Plessl, C., & Platzner, M. (2003). TKDM – A Reconfigurable Co-processor
in a PC’s Memory Slot. In Proc. Int. Conf. on Field Programmable Technology
(ICFPT) (pp. 252–259). IEEE Computer Society. https://doi.org/10.1109/FPT.2003.1275755
bibtex: '@inproceedings{Plessl_Platzner_2003, title={TKDM – A Reconfigurable Co-processor
in a PC’s Memory Slot}, DOI={10.1109/FPT.2003.1275755},
booktitle={Proc. Int. Conf. on Field Programmable Technology (ICFPT)}, publisher={IEEE
Computer Society}, author={Plessl, Christian and Platzner, Marco}, year={2003},
pages={252–259} }'
chicago: Plessl, Christian, and Marco Platzner. “TKDM – A Reconfigurable Co-Processor
in a PC’s Memory Slot.” In Proc. Int. Conf. on Field Programmable Technology
(ICFPT), 252–59. IEEE Computer Society, 2003. https://doi.org/10.1109/FPT.2003.1275755.
ieee: C. Plessl and M. Platzner, “TKDM – A Reconfigurable Co-processor in a PC’s
Memory Slot,” in Proc. Int. Conf. on Field Programmable Technology (ICFPT),
2003, pp. 252–259.
mla: Plessl, Christian, and Marco Platzner. “TKDM – A Reconfigurable Co-Processor
in a PC’s Memory Slot.” Proc. Int. Conf. on Field Programmable Technology (ICFPT),
IEEE Computer Society, 2003, pp. 252–59, doi:10.1109/FPT.2003.1275755.
short: 'C. Plessl, M. Platzner, in: Proc. Int. Conf. on Field Programmable Technology
(ICFPT), IEEE Computer Society, 2003, pp. 252–259.'
date_created: 2018-04-17T15:03:34Z
date_updated: 2022-01-06T06:56:09Z
department:
- _id: '518'
- _id: '78'
doi: 10.1109/FPT.2003.1275755
keyword:
- coprocessor
- DIMM
- memory bus
- FPGA
- high performance computing
page: 252-259
publication: Proc. Int. Conf. on Field Programmable Technology (ICFPT)
publisher: IEEE Computer Society
status: public
title: TKDM – A Reconfigurable Co-processor in a PC's Memory Slot
type: conference
user_id: '24135'
year: '2003'
...
---
_id: '2419'
abstract:
- lang: eng
text: 'Wearable computers are embedded into the mobile environment of their users.
A design challenge for wearable systems is to combine the high performance required
for tasks such as video decoding with the low energy consumption required to maximise
battery runtimes and the flexibility demanded by the dynamics of the environment
and the applications. In this paper, we demonstrate that reconfigurable hardware
technology is able to answer this challenge. We present the concept and the prototype
implementation of an autonomous wearable unit with reconfigurable modules (WURM).
We discuss experiments that show the uses of reconfigurable hardware in WURM:
ASICs-on-demand and adaptive interfaces. Finally, we present an experiment with
an operating system layer for WURM.'
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Rolf
full_name: Enzler, Rolf
last_name: Enzler
- first_name: Herbert
full_name: Walder, Herbert
last_name: Walder
- first_name: Jan
full_name: Beutel, Jan
last_name: Beutel
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Lothar
full_name: Thiele, Lothar
last_name: Thiele
- first_name: Gerhard
full_name: Tröster, Gerhard
last_name: Tröster
citation:
ama: Plessl C, Enzler R, Walder H, et al. The Case for Reconfigurable Hardware in
Wearable Computing. Personal and Ubiquitous Computing. 2003;7(5):299-308.
doi:10.1007/s00779-003-0243-x
apa: Plessl, C., Enzler, R., Walder, H., Beutel, J., Platzner, M., Thiele, L., &
Tröster, G. (2003). The Case for Reconfigurable Hardware in Wearable Computing.
Personal and Ubiquitous Computing, 7(5), 299–308. https://doi.org/10.1007/s00779-003-0243-x
bibtex: '@article{Plessl_Enzler_Walder_Beutel_Platzner_Thiele_Tröster_2003, title={The
Case for Reconfigurable Hardware in Wearable Computing}, volume={7}, DOI={10.1007/s00779-003-0243-x},
number={5}, journal={Personal and Ubiquitous Computing}, publisher={Springer},
author={Plessl, Christian and Enzler, Rolf and Walder, Herbert and Beutel, Jan
and Platzner, Marco and Thiele, Lothar and Tröster, Gerhard}, year={2003}, pages={299–308}
}'
chicago: 'Plessl, Christian, Rolf Enzler, Herbert Walder, Jan Beutel, Marco Platzner,
Lothar Thiele, and Gerhard Tröster. “The Case for Reconfigurable Hardware in Wearable
Computing.” Personal and Ubiquitous Computing 7, no. 5 (2003): 299–308.
https://doi.org/10.1007/s00779-003-0243-x.'
ieee: C. Plessl et al., “The Case for Reconfigurable Hardware in Wearable
Computing,” Personal and Ubiquitous Computing, vol. 7, no. 5, pp. 299–308,
2003.
mla: Plessl, Christian, et al. “The Case for Reconfigurable Hardware in Wearable
Computing.” Personal and Ubiquitous Computing, vol. 7, no. 5, Springer,
2003, pp. 299–308, doi:10.1007/s00779-003-0243-x.
short: C. Plessl, R. Enzler, H. Walder, J. Beutel, M. Platzner, L. Thiele, G. Tröster,
Personal and Ubiquitous Computing 7 (2003) 299–308.
date_created: 2018-04-17T15:04:47Z
date_updated: 2022-01-06T06:56:09Z
department:
- _id: '518'
- _id: '78'
doi: 10.1007/s00779-003-0243-x
extern: '1'
intvolume: ' 7'
issue: '5'
language:
- iso: eng
page: 299-308
publication: Personal and Ubiquitous Computing
publisher: Springer
status: public
title: The Case for Reconfigurable Hardware in Wearable Computing
type: journal_article
user_id: '398'
volume: 7
year: '2003'
...
---
_id: '2420'
abstract:
- lang: eng
text: ' This paper presents the acceleration of minimum-cost covering problems by
instance-specific hardware. First, we formulate the minimum-cost covering problem
and discuss a branch \& bound algorithm to solve it. Then we describe instance-specific
hardware architectures that implement branch \& bound in 3-valued logic and use
reduction techniques similar to those found in software solvers. We further present
prototypical accelerator implementations and a corresponding design tool flow.
Our experiments reveal significant raw speedups up to five orders of magnitude
for a set of smaller unate covering problems. Provided that hardware compilation
times can be reduced, we conclude that instance-specific acceleration of hard
minimum-cost covering problems will lead to substantial overall speedups. '
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Plessl C, Platzner M. Instance-Specific Accelerators for Minimum Covering.
Journal of Supercomputing. 2003;26(2):109-129. doi:10.1023/a:1024443416592
apa: Plessl, C., & Platzner, M. (2003). Instance-Specific Accelerators for Minimum
Covering. Journal of Supercomputing, 26(2), 109–129. https://doi.org/10.1023/a:1024443416592
bibtex: '@article{Plessl_Platzner_2003, title={Instance-Specific Accelerators for
Minimum Covering}, volume={26}, DOI={10.1023/a:1024443416592},
number={2}, journal={Journal of Supercomputing}, publisher={Kluwer Academic Publishers},
author={Plessl, Christian and Platzner, Marco}, year={2003}, pages={109–129} }'
chicago: 'Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators
for Minimum Covering.” Journal of Supercomputing 26, no. 2 (2003): 109–29.
https://doi.org/10.1023/a:1024443416592.'
ieee: C. Plessl and M. Platzner, “Instance-Specific Accelerators for Minimum Covering,”
Journal of Supercomputing, vol. 26, no. 2, pp. 109–129, 2003.
mla: Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators for
Minimum Covering.” Journal of Supercomputing, vol. 26, no. 2, Kluwer Academic
Publishers, 2003, pp. 109–29, doi:10.1023/a:1024443416592.
short: C. Plessl, M. Platzner, Journal of Supercomputing 26 (2003) 109–129.
date_created: 2018-04-17T15:10:00Z
date_updated: 2022-01-06T06:56:10Z
department:
- _id: '518'
- _id: '78'
doi: 10.1023/a:1024443416592
extern: '1'
intvolume: ' 26'
issue: '2'
keyword:
- reconfigurable computing
- instance-specific acceleration
- minimum covering
language:
- iso: eng
page: 109-129
publication: Journal of Supercomputing
publication_identifier:
issn:
- 0920-8542
publisher: Kluwer Academic Publishers
status: public
title: Instance-Specific Accelerators for Minimum Covering
type: journal_article
user_id: '398'
volume: 26
year: '2003'
...
---
_id: '2421'
abstract:
- lang: eng
text: In contrast to processors, current reconfigurable devices totally lack programming
models that would allow for device independent compilation and forward compatibility.
The key to overcome this limitation is hardware virtualization. In this paper,
we resort to a macro-pipelined execution model to achieve hardware virtualization
for data streaming applications. As a hardware implementation we present a hybrid
multi-context architecture that attaches a coarse-grained reconfigurable array
to a host CPU. A co-simulation framework enables cycle-accurate simulation of
the complete architecture. As a case study we map an FIR filter to our virtualized
hardware model and evaluate different designs. We discuss the impact of the number
of contexts and the feature of context state on the speedup and the CPU load.
author:
- first_name: Rolf
full_name: Enzler, Rolf
last_name: Enzler
- 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: 'Enzler R, Plessl C, Platzner M. Virtualizing Hardware with Multi-Context Reconfigurable
Arrays. In: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL).
Vol 2778. Lecture Notes in Computer Science (LNCS). Springer; 2003:151-160. doi:10.1007/b12007'
apa: Enzler, R., Plessl, C., & Platzner, M. (2003). Virtualizing Hardware with
Multi-Context Reconfigurable Arrays. In Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL) (Vol. 2778, pp. 151–160). Springer. https://doi.org/10.1007/b12007
bibtex: '@inproceedings{Enzler_Plessl_Platzner_2003, series={Lecture Notes in Computer
Science (LNCS)}, title={Virtualizing Hardware with Multi-Context Reconfigurable
Arrays}, volume={2778}, DOI={10.1007/b12007},
booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)},
publisher={Springer}, author={Enzler, Rolf and Plessl, Christian and Platzner,
Marco}, year={2003}, pages={151–160}, collection={Lecture Notes in Computer Science
(LNCS)} }'
chicago: Enzler, Rolf, Christian Plessl, and Marco Platzner. “Virtualizing Hardware
with Multi-Context Reconfigurable Arrays.” In Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL), 2778:151–60. Lecture Notes in Computer Science
(LNCS). Springer, 2003. https://doi.org/10.1007/b12007.
ieee: R. Enzler, C. Plessl, and M. Platzner, “Virtualizing Hardware with Multi-Context
Reconfigurable Arrays,” in Proc. Int. Conf. on Field Programmable Logic and
Applications (FPL), 2003, vol. 2778, pp. 151–160.
mla: Enzler, Rolf, et al. “Virtualizing Hardware with Multi-Context Reconfigurable
Arrays.” Proc. Int. Conf. on Field Programmable Logic and Applications (FPL),
vol. 2778, Springer, 2003, pp. 151–60, doi:10.1007/b12007.
short: 'R. Enzler, C. Plessl, M. Platzner, in: Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL), Springer, 2003, pp. 151–160.'
date_created: 2018-04-17T15:11:25Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '518'
- _id: '78'
doi: 10.1007/b12007
intvolume: ' 2778'
keyword:
- Zippy
- multi-context
- FPGA
page: 151-160
publication: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: Virtualizing Hardware with Multi-Context Reconfigurable Arrays
type: conference
user_id: '24135'
volume: 2778
year: '2003'
...
---
_id: '2422'
abstract:
- lang: eng
text: Reconfigurable computing architectures aim to dynamically adapt their hardware
to the application at hand. As research shows, the time it takes to reconfigure
the hardware forms an overhead that can significantly impair the benefits of hardware
customization. Multi-context devices are one promising approach to overcome the
limitations posed by long reconfiguration times. In contrast to more traditional
reconfigurable architectures, multi-context devices hold several configurations
on-chip. On demand, the device can quickly switch to another context. In this
paper we present a co-simulation environment to investigate design trade-offs
for hybrid multi-context architectures. Our architectural model comprises a reconfigurable
unit closely coupled to a CPU core. As a case study, we discuss the implementation
of a FIR filter partitioned into several contexts. We outline the mapping process
and present simulation results for single- and multi-context reconfigurable units
coupled with both embedded and high-end CPUs.
author:
- first_name: Rolf
full_name: Enzler, Rolf
last_name: Enzler
- 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: 'Enzler R, Plessl C, Platzner M. Co-simulation of a Hybrid Multi-Context Architecture.
In: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA). CSREA Press; 2003:174-180.'
apa: Enzler, R., Plessl, C., & Platzner, M. (2003). Co-simulation of a Hybrid
Multi-Context Architecture. In Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA) (pp. 174–180). CSREA Press.
bibtex: '@inproceedings{Enzler_Plessl_Platzner_2003, title={Co-simulation of a Hybrid
Multi-Context Architecture}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Enzler, Rolf
and Plessl, Christian and Platzner, Marco}, year={2003}, pages={174–180} }'
chicago: Enzler, Rolf, Christian Plessl, and Marco Platzner. “Co-Simulation of a
Hybrid Multi-Context Architecture.” In Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA), 174–80. CSREA Press, 2003.
ieee: R. Enzler, C. Plessl, and M. Platzner, “Co-simulation of a Hybrid Multi-Context
Architecture,” in Proc. Int. Conf. on Engineering of Reconfigurable Systems
and Algorithms (ERSA), 2003, pp. 174–180.
mla: Enzler, Rolf, et al. “Co-Simulation of a Hybrid Multi-Context Architecture.”
Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA),
CSREA Press, 2003, pp. 174–80.
short: 'R. Enzler, C. Plessl, M. Platzner, in: Proc. Int. Conf. on Engineering of
Reconfigurable Systems and Algorithms (ERSA), CSREA Press, 2003, pp. 174–180.'
date_created: 2018-04-17T15:12:56Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '518'
- _id: '78'
keyword:
- Zippy
- co-simulation
page: 174-180
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA)
publication_identifier:
isbn:
- 1-932415-05-X
publisher: CSREA Press
status: public
title: Co-simulation of a Hybrid Multi-Context Architecture
type: conference
user_id: '24135'
year: '2003'
...
---
_id: '24273'
author:
- first_name: Martina
full_name: Terbahl, Martina
last_name: Terbahl
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
citation:
ama: 'Terbahl M, Krokowski J. Verteiltes Rendern durch dynamische Bildaufteilung.
In: Proceedings of 5. GI-Informatiktage 2003. ; 2003.'
apa: Terbahl, M., & Krokowski, J. (2003). Verteiltes Rendern durch dynamische
Bildaufteilung. Proceedings of 5. GI-Informatiktage 2003.
bibtex: '@inproceedings{Terbahl_Krokowski_2003, place={Bad Schussenried, Germany},
title={Verteiltes Rendern durch dynamische Bildaufteilung}, booktitle={Proceedings
of 5. GI-Informatiktage 2003}, author={Terbahl, Martina and Krokowski, Jens},
year={2003} }'
chicago: Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische
Bildaufteilung.” In Proceedings of 5. GI-Informatiktage 2003. Bad Schussenried,
Germany, 2003.
ieee: M. Terbahl and J. Krokowski, “Verteiltes Rendern durch dynamische Bildaufteilung,”
2003.
mla: Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische
Bildaufteilung.” Proceedings of 5. GI-Informatiktage 2003, 2003.
short: 'M. Terbahl, J. Krokowski, in: Proceedings of 5. GI-Informatiktage 2003,
Bad Schussenried, Germany, 2003.'
date_created: 2021-09-13T12:06:43Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
language:
- iso: eng
place: Bad Schussenried, Germany
publication: Proceedings of 5. GI-Informatiktage 2003
status: public
title: Verteiltes Rendern durch dynamische Bildaufteilung
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '26263'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. Stability versus Speed in a Computable Algebraic Model. In: Proc.
5th Conference on Real Numbers and Computers (RNC5), INRIA. ; 2003:47-64.'
apa: Ziegler, M. (2003). Stability versus Speed in a Computable Algebraic Model.
Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 47–64.
bibtex: '@inproceedings{Ziegler_2003, title={Stability versus Speed in a Computable
Algebraic Model}, booktitle={Proc. 5th Conference on Real Numbers and Computers
(RNC5), INRIA}, author={Ziegler, Martin}, year={2003}, pages={47–64} }'
chicago: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
In Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 47–64,
2003.
ieee: M. Ziegler, “Stability versus Speed in a Computable Algebraic Model,” in Proc.
5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003, pp. 47–64.
mla: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003,
pp. 47–64.
short: 'M. Ziegler, in: Proc. 5th Conference on Real Numbers and Computers (RNC5),
INRIA, 2003, pp. 47–64.'
date_created: 2021-10-15T11:00:14Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: 47-64
publication: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA
status: public
title: Stability versus Speed in a Computable Algebraic Model
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '26277'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. Computable Operators on Regular Sets. In: Computability and
Complexity in Analysis. Vol 302-8/2003. Informatik Berichte. ; 2003:389-406.'
apa: Ziegler, M. (2003). Computable Operators on Regular Sets. Computability
and Complexity in Analysis, 302-8/2003, 389–406.
bibtex: '@inproceedings{Ziegler_2003, series={Informatik Berichte}, title={Computable
Operators on Regular Sets}, volume={302–8/2003}, booktitle={Computability and
Complexity in Analysis}, author={Ziegler, Martin}, year={2003}, pages={389–406},
collection={Informatik Berichte} }'
chicago: Ziegler, Martin. “Computable Operators on Regular Sets.” In Computability
and Complexity in Analysis, 302-8/2003:389–406. Informatik Berichte, 2003.
ieee: M. Ziegler, “Computable Operators on Regular Sets,” in Computability and
Complexity in Analysis, 2003, vol. 302–8/2003, pp. 389–406.
mla: Ziegler, Martin. “Computable Operators on Regular Sets.” Computability and
Complexity in Analysis, vol. 302-8/2003, 2003, pp. 389–406.
short: 'M. Ziegler, in: Computability and Complexity in Analysis, 2003, pp. 389–406.'
date_created: 2021-10-15T12:13:22Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: 389-406
publication: Computability and Complexity in Analysis
series_title: Informatik Berichte
status: public
title: Computable Operators on Regular Sets
type: conference
user_id: '15415'
volume: 302-8/2003
year: '2003'
...
---
_id: '3236'
author:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
citation:
ama: Wehrheim H. Behavioral Subtyping Relations for Active Objects. Formal Methods
in System Design. 2003;(2):143--170. doi:10.1023/A:1024764232069
apa: Wehrheim, H. (2003). Behavioral Subtyping Relations for Active Objects. Formal
Methods in System Design, (2), 143--170. https://doi.org/10.1023/A:1024764232069
bibtex: '@article{Wehrheim_2003, title={Behavioral Subtyping Relations for Active
Objects}, DOI={10.1023/A:1024764232069},
number={2}, journal={Formal Methods in System Design}, author={Wehrheim, Heike},
year={2003}, pages={143--170} }'
chicago: 'Wehrheim, Heike. “Behavioral Subtyping Relations for Active Objects.”
Formal Methods in System Design, no. 2 (2003): 143--170. https://doi.org/10.1023/A:1024764232069.'
ieee: H. Wehrheim, “Behavioral Subtyping Relations for Active Objects,” Formal
Methods in System Design, no. 2, pp. 143--170, 2003.
mla: Wehrheim, Heike. “Behavioral Subtyping Relations for Active Objects.” Formal
Methods in System Design, no. 2, 2003, pp. 143--170, doi:10.1023/A:1024764232069.
short: H. Wehrheim, Formal Methods in System Design (2003) 143--170.
date_created: 2018-06-14T06:49:57Z
date_updated: 2022-01-06T06:59:06Z
department:
- _id: '77'
doi: 10.1023/A:1024764232069
issue: '2'
page: 143--170
publication: Formal Methods in System Design
status: public
title: Behavioral Subtyping Relations for Active Objects
type: journal_article
user_id: '29719'
year: '2003'
...
---
_id: '3237'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Preserving Properties Under Change. In: S. de Boer F, M. Bonsangue
M, Graf S, P. de Roever W, eds. Formal Methods for Components and Objects,
Second International Symposium, {FMCO} 2003, Leiden, The Netherlands, November
4-7, 2003, Revised Lectures. Lecture Notes in Computer Science. ; 2003:330--343.
doi:10.1007/978-3-540-30101-1_16'
apa: Wehrheim, H. (2003). Preserving Properties Under Change. In F. S. de Boer,
M. M. Bonsangue, S. Graf, & W. P. de Roever (Eds.), Formal Methods for
Components and Objects, Second International Symposium, {FMCO} 2003, Leiden, The
Netherlands, November 4-7, 2003, Revised Lectures (pp. 330--343). https://doi.org/10.1007/978-3-540-30101-1_16
bibtex: '@inproceedings{Wehrheim_2003, series={Lecture Notes in Computer Science},
title={Preserving Properties Under Change}, DOI={10.1007/978-3-540-30101-1_16},
booktitle={Formal Methods for Components and Objects, Second International Symposium,
{FMCO} 2003, Leiden, The Netherlands, November 4-7, 2003, Revised Lectures}, author={Wehrheim,
Heike}, editor={S. de Boer, Frank and M. Bonsangue, Marcello and Graf, Susanne
and P. de Roever, WillemEditors}, year={2003}, pages={330--343}, collection={Lecture
Notes in Computer Science} }'
chicago: Wehrheim, Heike. “Preserving Properties Under Change.” In Formal Methods
for Components and Objects, Second International Symposium, {FMCO} 2003, Leiden,
The Netherlands, November 4-7, 2003, Revised Lectures, edited by Frank S.
de Boer, Marcello M. Bonsangue, Susanne Graf, and Willem P. de Roever, 330--343.
Lecture Notes in Computer Science, 2003. https://doi.org/10.1007/978-3-540-30101-1_16.
ieee: H. Wehrheim, “Preserving Properties Under Change,” in Formal Methods for
Components and Objects, Second International Symposium, {FMCO} 2003, Leiden, The
Netherlands, November 4-7, 2003, Revised Lectures, 2003, pp. 330--343.
mla: Wehrheim, Heike. “Preserving Properties Under Change.” Formal Methods for
Components and Objects, Second International Symposium, {FMCO} 2003, Leiden, The
Netherlands, November 4-7, 2003, Revised Lectures, edited by Frank S. de Boer
et al., 2003, pp. 330--343, doi:10.1007/978-3-540-30101-1_16.
short: 'H. Wehrheim, in: F. S. de Boer, M. M. Bonsangue, S. Graf, W. P. de Roever
(Eds.), Formal Methods for Components and Objects, Second International Symposium,
{FMCO} 2003, Leiden, The Netherlands, November 4-7, 2003, Revised Lectures, 2003,
pp. 330--343.'
date_created: 2018-06-14T06:51:09Z
date_updated: 2022-01-06T06:59:06Z
department:
- _id: '77'
doi: 10.1007/978-3-540-30101-1_16
editor:
- first_name: Frank
full_name: S. de Boer, Frank
last_name: S. de Boer
- first_name: Marcello
full_name: M. Bonsangue, Marcello
last_name: M. Bonsangue
- first_name: Susanne
full_name: Graf, Susanne
last_name: Graf
- first_name: Willem
full_name: P. de Roever, Willem
last_name: P. de Roever
page: 330--343
publication: Formal Methods for Components and Objects, Second International Symposium,
{FMCO} 2003, Leiden, The Netherlands, November 4-7, 2003, Revised Lectures
series_title: Lecture Notes in Computer Science
status: public
title: Preserving Properties Under Change
type: conference
user_id: '29719'
year: '2003'
...
---
_id: '3238'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Inheritance of Temporal Logic Properties. In: Najm E, Nestmann
U, Stevens P, eds. Formal Methods for Open Object-Based Distributed Systems,
6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November
19.21, 2003, Proceedings. Lecture Notes in Computer Science. ; 2003:79--93.
doi:10.1007/978-3-540-39958-2_6'
apa: Wehrheim, H. (2003). Inheritance of Temporal Logic Properties. In E. Najm,
U. Nestmann, & P. Stevens (Eds.), Formal Methods for Open Object-Based
Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003,
Paris, France, November 19.21, 2003, Proceedings (pp. 79--93). https://doi.org/10.1007/978-3-540-39958-2_6
bibtex: '@inproceedings{Wehrheim_2003, series={Lecture Notes in Computer Science},
title={Inheritance of Temporal Logic Properties}, DOI={10.1007/978-3-540-39958-2_6},
booktitle={Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21,
2003, Proceedings}, author={Wehrheim, Heike}, editor={Najm, Elie and Nestmann,
Uwe and Stevens, PerditaEditors}, year={2003}, pages={79--93}, collection={Lecture
Notes in Computer Science} }'
chicago: Wehrheim, Heike. “Inheritance of Temporal Logic Properties.” In Formal
Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International
Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings,
edited by Elie Najm, Uwe Nestmann, and Perdita Stevens, 79--93. Lecture Notes
in Computer Science, 2003. https://doi.org/10.1007/978-3-540-39958-2_6.
ieee: H. Wehrheim, “Inheritance of Temporal Logic Properties,” in Formal Methods
for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference,
{FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings, 2003, pp.
79--93.
mla: Wehrheim, Heike. “Inheritance of Temporal Logic Properties.” Formal Methods
for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference,
{FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings, edited by
Elie Najm et al., 2003, pp. 79--93, doi:10.1007/978-3-540-39958-2_6.
short: 'H. Wehrheim, in: E. Najm, U. Nestmann, P. Stevens (Eds.), Formal Methods
for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference,
{FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings, 2003, pp. 79--93.'
date_created: 2018-06-14T06:52:17Z
date_updated: 2022-01-06T06:59:06Z
department:
- _id: '77'
doi: 10.1007/978-3-540-39958-2_6
editor:
- first_name: Elie
full_name: Najm, Elie
last_name: Najm
- first_name: Uwe
full_name: Nestmann, Uwe
last_name: Nestmann
- first_name: Perdita
full_name: Stevens, Perdita
last_name: Stevens
page: 79--93
publication: Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21,
2003, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Inheritance of Temporal Logic Properties
type: conference
user_id: '29719'
year: '2003'
...
---
_id: '3239'
author:
- first_name: Holger
full_name: Rasch, Holger
last_name: Rasch
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Rasch H, Wehrheim H. Checking Consistency in {UML} Diagramms: Classes and
State Machines. In: Najm E, Nestmann U, Stevens P, eds. Formal Methods for
Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International Conference,
{FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings. Lecture Notes
in Computer Science. ; 2003:229--243. doi:10.1007/978-3-540-39958-2_16'
apa: 'Rasch, H., & Wehrheim, H. (2003). Checking Consistency in {UML} Diagramms:
Classes and State Machines. In E. Najm, U. Nestmann, & P. Stevens (Eds.),
Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1
International Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003,
Proceedings (pp. 229--243). https://doi.org/10.1007/978-3-540-39958-2_16'
bibtex: '@inproceedings{Rasch_Wehrheim_2003, series={Lecture Notes in Computer Science},
title={Checking Consistency in {UML} Diagramms: Classes and State Machines}, DOI={10.1007/978-3-540-39958-2_16},
booktitle={Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21,
2003, Proceedings}, author={Rasch, Holger and Wehrheim, Heike}, editor={Najm,
Elie and Nestmann, Uwe and Stevens, PerditaEditors}, year={2003}, pages={229--243},
collection={Lecture Notes in Computer Science} }'
chicago: 'Rasch, Holger, and Heike Wehrheim. “Checking Consistency in {UML} Diagramms:
Classes and State Machines.” In Formal Methods for Open Object-Based Distributed
Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France,
November 19.21, 2003, Proceedings, edited by Elie Najm, Uwe Nestmann, and
Perdita Stevens, 229--243. Lecture Notes in Computer Science, 2003. https://doi.org/10.1007/978-3-540-39958-2_16.'
ieee: 'H. Rasch and H. Wehrheim, “Checking Consistency in {UML} Diagramms: Classes
and State Machines,” in Formal Methods for Open Object-Based Distributed Systems,
6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November
19.21, 2003, Proceedings, 2003, pp. 229--243.'
mla: 'Rasch, Holger, and Heike Wehrheim. “Checking Consistency in {UML} Diagramms:
Classes and State Machines.” Formal Methods for Open Object-Based Distributed
Systems, 6th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2003, Paris, France,
November 19.21, 2003, Proceedings, edited by Elie Najm et al., 2003, pp. 229--243,
doi:10.1007/978-3-540-39958-2_16.'
short: 'H. Rasch, H. Wehrheim, in: E. Najm, U. Nestmann, P. Stevens (Eds.), Formal
Methods for Open Object-Based Distributed Systems, 6th {IFIP} {WG} 6.1 International
Conference, {FMOODS} 2003, Paris, France, November 19.21, 2003, Proceedings, 2003,
pp. 229--243.'
date_created: 2018-06-14T06:53:24Z
date_updated: 2022-01-06T06:59:06Z
department:
- _id: '77'
doi: 10.1007/978-3-540-39958-2_16
editor:
- first_name: Elie
full_name: Najm, Elie
last_name: Najm
- first_name: Uwe
full_name: Nestmann, Uwe
last_name: Nestmann
- first_name: Perdita
full_name: Stevens, Perdita
last_name: Stevens
page: 229--243
publication: Formal Methods for Open Object-Based Distributed Systems, 6th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2003, Paris, France, November 19.21,
2003, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: 'Checking Consistency in {UML} Diagramms: Classes and State Machines'
type: conference
user_id: '29719'
year: '2003'
...
---
_id: '3240'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Wehrheim H. Using Coupled Simulations in Non-atomic Refinement.
In: Bert D, P. Bowen J, King S, A. Wald{\’{e}}n M, eds. {ZB} 2003: Formal Specification
and Development in {Z} and B, Third International Conference of {B} and {Z} Users,
Turku, Finland, June 4-6, 2003, Proceedings. Lecture Notes in Computer Science.
; 2003:127--147. doi:10.1007/3-540-44880-2_10'
apa: 'Derrick, J., & Wehrheim, H. (2003). Using Coupled Simulations in Non-atomic
Refinement. In D. Bert, J. P. Bowen, S. King, & M. A. Wald{\’{e}}n (Eds.),
{ZB} 2003: Formal Specification and Development in {Z} and B, Third International
Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003, Proceedings
(pp. 127--147). https://doi.org/10.1007/3-540-44880-2_10'
bibtex: '@inproceedings{Derrick_Wehrheim_2003, series={Lecture Notes in Computer
Science}, title={Using Coupled Simulations in Non-atomic Refinement}, DOI={10.1007/3-540-44880-2_10},
booktitle={{ZB} 2003: Formal Specification and Development in {Z} and B, Third
International Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003,
Proceedings}, author={Derrick, John and Wehrheim, Heike}, editor={Bert, Didier
and P. Bowen, Jonathan and King, Steve and A. Wald{\’{e}}n, MarinaEditors}, year={2003},
pages={127--147}, collection={Lecture Notes in Computer Science} }'
chicago: 'Derrick, John, and Heike Wehrheim. “Using Coupled Simulations in Non-Atomic
Refinement.” In {ZB} 2003: Formal Specification and Development in {Z} and
B, Third International Conference of {B} and {Z} Users, Turku, Finland, June 4-6,
2003, Proceedings, edited by Didier Bert, Jonathan P. Bowen, Steve King, and
Marina A. Wald{\’{e}}n, 127--147. Lecture Notes in Computer Science, 2003. https://doi.org/10.1007/3-540-44880-2_10.'
ieee: 'J. Derrick and H. Wehrheim, “Using Coupled Simulations in Non-atomic Refinement,”
in {ZB} 2003: Formal Specification and Development in {Z} and B, Third International
Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003, Proceedings,
2003, pp. 127--147.'
mla: 'Derrick, John, and Heike Wehrheim. “Using Coupled Simulations in Non-Atomic
Refinement.” {ZB} 2003: Formal Specification and Development in {Z} and B,
Third International Conference of {B} and {Z} Users, Turku, Finland, June 4-6,
2003, Proceedings, edited by Didier Bert et al., 2003, pp. 127--147, doi:10.1007/3-540-44880-2_10.'
short: 'J. Derrick, H. Wehrheim, in: D. Bert, J. P. Bowen, S. King, M. A. Wald{\’{e}}n
(Eds.), {ZB} 2003: Formal Specification and Development in {Z} and B, Third International
Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003, Proceedings,
2003, pp. 127--147.'
date_created: 2018-06-14T06:54:54Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/3-540-44880-2_10
editor:
- first_name: Didier
full_name: Bert, Didier
last_name: Bert
- first_name: Jonathan
full_name: P. Bowen, Jonathan
last_name: P. Bowen
- first_name: Steve
full_name: King, Steve
last_name: King
- first_name: Marina
full_name: A. Wald{\'{e}}n, Marina
last_name: A. Wald{\'{e}}n
page: 127--147
publication: '{ZB} 2003: Formal Specification and Development in {Z} and B, Third
International Conference of {B} and {Z} Users, Turku, Finland, June 4-6, 2003, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Using Coupled Simulations in Non-atomic Refinement
type: conference
user_id: '29719'
year: '2003'
...