---
_id: '19851'
abstract:
- lang: eng
text: The Internet-SCSI protocol [iSCSI] allows a client to interact with a remote
SCSI-capable target by means of block-oriented commands encapsulated within TCP/IP
packets. Thereby, iSCSI greatly simplifies storage virtualization, since clients
can access storage in a unified manner, no matter whether the I/O-path is short
or long distance. Intermediate devices located on the path between a client and
a target can easily intercept iSCSI sessions and rewrite packets for the sake
of load balancing, prefetching, or redundancy, to mention just a few beneficial
applications. Within this paper we describe the design and implementation of such
an iSCSI capable intermediate device that deploys prefetching strategies in combination
with redundant disks to reduce average I/O-latency. Depending on its location
within the network, this virtualization and prefetching device can hide wide area
access latency and reduce network contention targeting remote SCSI-devices to
a large extent.
author:
- first_name: Peter
full_name: Bleckmann, Peter
last_name: Bleckmann
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
- first_name: Adrian
full_name: Slowik, Adrian
last_name: Slowik
citation:
ama: 'Bleckmann P, Schomaker G, Slowik A. Virtualization with prefetching abilities
based on iSCSI. In: Proceeding of International Workshop on Storage Network
Architecture and Parallel I/O. ; 2004:40-47. doi:10.1145/1162628.1162634'
apa: Bleckmann, P., Schomaker, G., & Slowik, A. (2004). Virtualization with
prefetching abilities based on iSCSI. Proceeding of International Workshop
on Storage Network Architecture and Parallel I/O, 2, 40–47. https://doi.org/10.1145/1162628.1162634
bibtex: '@inproceedings{Bleckmann_Schomaker_Slowik_2004, title={Virtualization with
prefetching abilities based on iSCSI}, DOI={10.1145/1162628.1162634},
number={2}, booktitle={Proceeding of International Workshop on Storage Network
Architecture and Parallel I/O}, author={Bleckmann, Peter and Schomaker, Gunnar
and Slowik, Adrian}, year={2004}, pages={40–47} }'
chicago: Bleckmann, Peter, Gunnar Schomaker, and Adrian Slowik. “Virtualization
with Prefetching Abilities Based on ISCSI.” In Proceeding of International
Workshop on Storage Network Architecture and Parallel I/O, 40–47, 2004. https://doi.org/10.1145/1162628.1162634.
ieee: 'P. Bleckmann, G. Schomaker, and A. Slowik, “Virtualization with prefetching
abilities based on iSCSI,” in Proceeding of International Workshop on Storage
Network Architecture and Parallel I/O, 2004, no. 2, pp. 40–47, doi: 10.1145/1162628.1162634.'
mla: Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on
ISCSI.” Proceeding of International Workshop on Storage Network Architecture
and Parallel I/O, no. 2, 2004, pp. 40–47, doi:10.1145/1162628.1162634.
short: 'P. Bleckmann, G. Schomaker, A. Slowik, in: Proceeding of International Workshop
on Storage Network Architecture and Parallel I/O, 2004, pp. 40–47.'
date_created: 2020-10-02T11:40:12Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1162628.1162634
issue: '2'
language:
- iso: eng
page: 40-47
publication: Proceeding of International Workshop on Storage Network Architecture
and Parallel I/O
publication_status: published
status: public
title: Virtualization with prefetching abilities based on iSCSI
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19879'
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. Point Cloud Surfaces using Geometric Proximity Graphs.
Computers and Graphics. 2004;28(6):839-850. doi:10.1016/j.cag.2004.08.012
apa: Klein, J., & Zachmann, G. (2004). Point Cloud Surfaces using Geometric
Proximity Graphs. Computers and Graphics, 28(6), 839–850. https://doi.org/10.1016/j.cag.2004.08.012
bibtex: '@article{Klein_Zachmann_2004, title={Point Cloud Surfaces using Geometric
Proximity Graphs}, volume={28}, DOI={10.1016/j.cag.2004.08.012},
number={6}, journal={Computers and Graphics}, author={Klein, Jan and Zachmann,
Gabriel}, year={2004}, pages={839–850} }'
chicago: 'Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric
Proximity Graphs.” Computers and Graphics 28, no. 6 (2004): 839–50. https://doi.org/10.1016/j.cag.2004.08.012.'
ieee: J. Klein and G. Zachmann, “Point Cloud Surfaces using Geometric Proximity
Graphs,” Computers and Graphics, vol. 28, no. 6, pp. 839–850, 2004.
mla: Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity
Graphs.” Computers and Graphics, vol. 28, no. 6, 2004, pp. 839–50, doi:10.1016/j.cag.2004.08.012.
short: J. Klein, G. Zachmann, Computers and Graphics 28 (2004) 839–850.
date_created: 2020-10-05T12:57:39Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1016/j.cag.2004.08.012
intvolume: ' 28'
issue: '6'
language:
- iso: eng
page: 839-850
publication: Computers and Graphics
status: public
title: Point Cloud Surfaces using Geometric Proximity Graphs
type: journal_article
user_id: '15415'
volume: 28
year: '2004'
...
---
_id: '19883'
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. Proximity Graphs for Defining Surfaces over Point Clouds.
In: Eurographics Symposium on Point-Based Grahics (SPBG’04). ; 2004:131-138.'
apa: Klein, J., & Zachmann, G. (2004). Proximity Graphs for Defining Surfaces
over Point Clouds. In Eurographics Symposium on Point-Based Grahics (SPBG’04)
(pp. 131–138).
bibtex: '@inproceedings{Klein_Zachmann_2004, title={Proximity Graphs for Defining
Surfaces over Point Clouds}, booktitle={Eurographics Symposium on Point-Based
Grahics (SPBG’04)}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={131–138}
}'
chicago: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces
over Point Clouds.” In Eurographics Symposium on Point-Based Grahics (SPBG’04),
131–38, 2004.
ieee: J. Klein and G. Zachmann, “Proximity Graphs for Defining Surfaces over Point
Clouds,” in Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004,
pp. 131–138.
mla: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over
Point Clouds.” Eurographics Symposium on Point-Based Grahics (SPBG’04),
2004, pp. 131–38.
short: 'J. Klein, G. Zachmann, in: Eurographics Symposium on Point-Based Grahics
(SPBG’04), 2004, pp. 131–138.'
date_created: 2020-10-05T13:03:44Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 131-138
publication: Eurographics Symposium on Point-Based Grahics (SPBG'04)
status: public
title: Proximity Graphs for Defining Surfaces over Point Clouds
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19889'
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. Nice and Fast Implicit Surfaces over Noisy Point Clouds.
In: SIGGRAPH 2004, Sketches. ; 2004.'
apa: Klein, J., & Zachmann, G. (2004). Nice and Fast Implicit Surfaces over
Noisy Point Clouds. In SIGGRAPH 2004, Sketches.
bibtex: '@inproceedings{Klein_Zachmann_2004, title={Nice and Fast Implicit Surfaces
over Noisy Point Clouds}, booktitle={SIGGRAPH 2004, Sketches}, author={Klein,
Jan and Zachmann, Gabriel}, year={2004} }'
chicago: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over
Noisy Point Clouds.” In SIGGRAPH 2004, Sketches, 2004.
ieee: J. Klein and G. Zachmann, “Nice and Fast Implicit Surfaces over Noisy Point
Clouds,” in SIGGRAPH 2004, Sketches, 2004.
mla: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy
Point Clouds.” SIGGRAPH 2004, Sketches, 2004.
short: 'J. Klein, G. Zachmann, in: SIGGRAPH 2004, Sketches, 2004.'
date_created: 2020-10-05T13:31:16Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
publication: SIGGRAPH 2004, Sketches
status: public
title: Nice and Fast Implicit Surfaces over Noisy Point Clouds
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19891'
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. Point Cloud Collision Detection. In: Computer Graphics
Forum (Proceedings of EUROGRAPHICS 2004). ; 2004:567-576.'
apa: Klein, J., & Zachmann, G. (2004). Point Cloud Collision Detection. In Computer
Graphics Forum (Proceedings of EUROGRAPHICS 2004) (pp. 567–576).
bibtex: '@inproceedings{Klein_Zachmann_2004, title={Point Cloud Collision Detection},
booktitle={Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)}, author={Klein,
Jan and Zachmann, Gabriel}, year={2004}, pages={567–576} }'
chicago: Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” In
Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), 567–76, 2004.
ieee: J. Klein and G. Zachmann, “Point Cloud Collision Detection,” in Computer
Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–576.
mla: Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” Computer
Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–76.
short: 'J. Klein, G. Zachmann, in: Computer Graphics Forum (Proceedings of EUROGRAPHICS
2004), 2004, pp. 567–576.'
date_created: 2020-10-05T13:49:10Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 567-576
publication: Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)
status: public
title: Point Cloud Collision Detection
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '2415'
abstract:
- lang: eng
text: 'In this paper we introduce to virtualization of hardware on reconfigurable
devices. We identify three main approaches denoted with temporal partitioning,
virtualized execution, and virtual machine. For each virtualization approach,
we discuss the application models, the required execution architectures, the design
tools and the run-time systems. Then, we survey a selection of important projects
in the field. '
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. Virtualization of Hardware – Introduction and Survey.
In: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA). CSREA Press; 2004:63-69.'
apa: Plessl, C., & Platzner, M. (2004). Virtualization of Hardware – Introduction
and Survey. In Proc. Int. Conf. on Engineering of Reconfigurable Systems and
Algorithms (ERSA) (pp. 63–69). CSREA Press.
bibtex: '@inproceedings{Plessl_Platzner_2004, title={Virtualization of Hardware
– Introduction and Survey}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Plessl, Christian
and Platzner, Marco}, year={2004}, pages={63–69} }'
chicago: Plessl, Christian, and Marco Platzner. “Virtualization of Hardware – Introduction
and Survey.” In Proc. Int. Conf. on Engineering of Reconfigurable Systems and
Algorithms (ERSA), 63–69. CSREA Press, 2004.
ieee: C. Plessl and M. Platzner, “Virtualization of Hardware – Introduction and
Survey,” in Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA), 2004, pp. 63–69.
mla: Plessl, Christian, and Marco Platzner. “Virtualization of Hardware – Introduction
and Survey.” Proc. Int. Conf. on Engineering of Reconfigurable Systems and
Algorithms (ERSA), CSREA Press, 2004, pp. 63–69.
short: 'C. Plessl, M. Platzner, in: Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA), CSREA Press, 2004, pp. 63–69.'
date_created: 2018-04-17T14:45:57Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '518'
- _id: '78'
keyword:
- hardware virtualization
page: 63-69
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA)
publisher: CSREA Press
status: public
title: Virtualization of Hardware – Introduction and Survey
type: conference
user_id: '24135'
year: '2004'
...
---
_id: '2416'
author:
- first_name: Sven
full_name: Groppe, Sven
last_name: Groppe
- first_name: Stefan
full_name: Böttcher, Stefan
last_name: Böttcher
- first_name: Georg
full_name: Birkenheuer, Georg
last_name: Birkenheuer
citation:
ama: 'Groppe S, Böttcher S, Birkenheuer G. Efficient Querying of Transformed XML
Documents. In: Proc. Int. Conf. on Enterprise Information Systems (ICEIS).
; 2004:241-250.'
apa: Groppe, S., Böttcher, S., & Birkenheuer, G. (2004). Efficient Querying
of Transformed XML Documents. In Proc. Int. Conf. on Enterprise Information
Systems (ICEIS) (pp. 241–250).
bibtex: '@inproceedings{Groppe_Böttcher_Birkenheuer_2004, title={Efficient Querying
of Transformed XML Documents}, booktitle={Proc. Int. Conf. on Enterprise Information
Systems (ICEIS)}, author={Groppe, Sven and Böttcher, Stefan and Birkenheuer, Georg},
year={2004}, pages={241–250} }'
chicago: Groppe, Sven, Stefan Böttcher, and Georg Birkenheuer. “Efficient Querying
of Transformed XML Documents.” In Proc. Int. Conf. on Enterprise Information
Systems (ICEIS), 241–50, 2004.
ieee: S. Groppe, S. Böttcher, and G. Birkenheuer, “Efficient Querying of Transformed
XML Documents,” in Proc. Int. Conf. on Enterprise Information Systems (ICEIS),
2004, pp. 241–250.
mla: Groppe, Sven, et al. “Efficient Querying of Transformed XML Documents.” Proc.
Int. Conf. on Enterprise Information Systems (ICEIS), 2004, pp. 241–50.
short: 'S. Groppe, S. Böttcher, G. Birkenheuer, in: Proc. Int. Conf. on Enterprise
Information Systems (ICEIS), 2004, pp. 241–250.'
date_created: 2018-04-17T14:48:54Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '27'
- _id: '69'
page: 241-250
publication: Proc. Int. Conf. on Enterprise Information Systems (ICEIS)
status: public
title: Efficient Querying of Transformed XML Documents
type: conference
user_id: '24135'
year: '2004'
...
---
_id: '2417'
author:
- first_name: Sven
full_name: Groppe, Sven
last_name: Groppe
- first_name: Stefan
full_name: Böttcher, Stefan
last_name: Böttcher
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Georg
full_name: Birkenheuer, Georg
last_name: Birkenheuer
citation:
ama: 'Groppe S, Böttcher S, Heckel R, Birkenheuer G. Using XSLT Stylesheets to Transform
XPath Queries. In: Proc. East-European Conf. on Advances in Databases and Information
Systems (ADBIS). ; 2004.'
apa: Groppe, S., Böttcher, S., Heckel, R., & Birkenheuer, G. (2004). Using XSLT
Stylesheets to Transform XPath Queries. In Proc. East-European Conf. on Advances
in Databases and Information Systems (ADBIS).
bibtex: '@inproceedings{Groppe_Böttcher_Heckel_Birkenheuer_2004, title={Using XSLT
Stylesheets to Transform XPath Queries}, booktitle={Proc. East-European Conf.
on Advances in Databases and Information Systems (ADBIS)}, author={Groppe, Sven
and Böttcher, Stefan and Heckel, Reiko and Birkenheuer, Georg}, year={2004} }'
chicago: Groppe, Sven, Stefan Böttcher, Reiko Heckel, and Georg Birkenheuer. “Using
XSLT Stylesheets to Transform XPath Queries.” In Proc. East-European Conf.
on Advances in Databases and Information Systems (ADBIS), 2004.
ieee: S. Groppe, S. Böttcher, R. Heckel, and G. Birkenheuer, “Using XSLT Stylesheets
to Transform XPath Queries,” in Proc. East-European Conf. on Advances in Databases
and Information Systems (ADBIS), 2004.
mla: Groppe, Sven, et al. “Using XSLT Stylesheets to Transform XPath Queries.” Proc.
East-European Conf. on Advances in Databases and Information Systems (ADBIS),
2004.
short: 'S. Groppe, S. Böttcher, R. Heckel, G. Birkenheuer, in: Proc. East-European
Conf. on Advances in Databases and Information Systems (ADBIS), 2004.'
date_created: 2018-04-17T14:50:15Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '27'
- _id: '69'
publication: Proc. East-European Conf. on Advances in Databases and Information Systems
(ADBIS)
status: public
title: Using XSLT Stylesheets to Transform XPath Queries
type: conference
user_id: '24135'
year: '2004'
...
---
_id: '26411'
author:
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Volbert K. Experimental analysis of adjustable sectorized topologies for static
ad hoc networks. In: Proceedings of the 2004 Joint Workshop on Foundations
of Mobile Computing - DIALM-POMC ’04. ; 2004. doi:10.1145/1022630.1022646'
apa: Volbert, K. (2004). Experimental analysis of adjustable sectorized topologies
for static ad hoc networks. Proceedings of the 2004 Joint Workshop on Foundations
of Mobile Computing - DIALM-POMC ’04. https://doi.org/10.1145/1022630.1022646
bibtex: '@inproceedings{Volbert_2004, title={Experimental analysis of adjustable
sectorized topologies for static ad hoc networks}, DOI={10.1145/1022630.1022646},
booktitle={Proceedings of the 2004 joint workshop on Foundations of mobile computing
- DIALM-POMC ’04}, author={Volbert, Klaus}, year={2004} }'
chicago: Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies
for Static Ad Hoc Networks.” In Proceedings of the 2004 Joint Workshop on Foundations
of Mobile Computing - DIALM-POMC ’04, 2004. https://doi.org/10.1145/1022630.1022646.
ieee: 'K. Volbert, “Experimental analysis of adjustable sectorized topologies for
static ad hoc networks,” 2004, doi: 10.1145/1022630.1022646.'
mla: Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies
for Static Ad Hoc Networks.” Proceedings of the 2004 Joint Workshop on Foundations
of Mobile Computing - DIALM-POMC ’04, 2004, doi:10.1145/1022630.1022646.
short: 'K. Volbert, in: Proceedings of the 2004 Joint Workshop on Foundations of
Mobile Computing - DIALM-POMC ’04, 2004.'
date_created: 2021-10-18T15:34:55Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '63'
- _id: '26'
doi: 10.1145/1022630.1022646
language:
- iso: eng
publication: Proceedings of the 2004 joint workshop on Foundations of mobile computing -
DIALM-POMC '04
publication_status: published
status: public
title: Experimental analysis of adjustable sectorized topologies for static ad hoc
networks
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '3233'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Refinement and Consistency in Component Models with Multiple Views.
In: H. Reussner R, A. Stafford J, A. Szyperski C, eds. Architecting Systems
with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany,
December 12-17, 2004. Revised Selected Papers. Lecture Notes in Computer Science.
; 2004:84--102. doi:10.1007/11786160_5'
apa: Wehrheim, H. (2004). Refinement and Consistency in Component Models with Multiple
Views. In R. H. Reussner, J. A. Stafford, & C. A. Szyperski (Eds.), Architecting
Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany,
December 12-17, 2004. Revised Selected Papers (pp. 84--102). https://doi.org/10.1007/11786160_5
bibtex: '@inproceedings{Wehrheim_2004, series={Lecture Notes in Computer Science},
title={Refinement and Consistency in Component Models with Multiple Views}, DOI={10.1007/11786160_5}, booktitle={Architecting
Systems with Trustworthy Components, International Seminar, Dagstuhl Castle, Germany,
December 12-17, 2004. Revised Selected Papers}, author={Wehrheim, Heike}, editor={H.
Reussner, Ralf and A. Stafford, Judith and A. Szyperski, ClemensEditors}, year={2004},
pages={84--102}, collection={Lecture Notes in Computer Science} }'
chicago: Wehrheim, Heike. “Refinement and Consistency in Component Models with Multiple
Views.” In Architecting Systems with Trustworthy Components, International
Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers,
edited by Ralf H. Reussner, Judith A. Stafford, and Clemens A. Szyperski, 84--102.
Lecture Notes in Computer Science, 2004. https://doi.org/10.1007/11786160_5.
ieee: H. Wehrheim, “Refinement and Consistency in Component Models with Multiple
Views,” in Architecting Systems with Trustworthy Components, International
Seminar, Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers,
2004, pp. 84--102.
mla: Wehrheim, Heike. “Refinement and Consistency in Component Models with Multiple
Views.” Architecting Systems with Trustworthy Components, International Seminar,
Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers, edited
by Ralf H. Reussner et al., 2004, pp. 84--102, doi:10.1007/11786160_5.
short: 'H. Wehrheim, in: R. H. Reussner, J. A. Stafford, C. A. Szyperski (Eds.),
Architecting Systems with Trustworthy Components, International Seminar, Dagstuhl
Castle, Germany, December 12-17, 2004. Revised Selected Papers, 2004, pp. 84--102.'
date_created: 2018-06-14T06:46:31Z
date_updated: 2022-01-06T06:59:06Z
department:
- _id: '77'
doi: 10.1007/11786160_5
editor:
- first_name: Ralf
full_name: H. Reussner, Ralf
last_name: H. Reussner
- first_name: Judith
full_name: A. Stafford, Judith
last_name: A. Stafford
- first_name: Clemens
full_name: A. Szyperski, Clemens
last_name: A. Szyperski
page: 84--102
publication: Architecting Systems with Trustworthy Components, International Seminar,
Dagstuhl Castle, Germany, December 12-17, 2004. Revised Selected Papers
series_title: Lecture Notes in Computer Science
status: public
title: Refinement and Consistency in Component Models with Multiple Views
type: conference
user_id: '29719'
year: '2004'
...
---
_id: '3234'
author:
- first_name: Michael
full_name: Möller, Michael
last_name: Möller
- first_name: Ernst-Rüdiger
full_name: Olderog, Ernst-Rüdiger
last_name: Olderog
- first_name: Holger
full_name: Rasch, Holger
last_name: Rasch
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Möller M, Olderog E-R, Rasch H, Wehrheim H. Linking {CSP-OZ} with {UML} and
Java: {A} Case Study. In: A. Boiten E, Derrick J, Smith G, eds. Integrated
Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April
4-7, 2004, Proceedings. Lecture Notes in Computer Science. ; 2004:267--286.
doi:10.1007/978-3-540-24756-2_15'
apa: 'Möller, M., Olderog, E.-R., Rasch, H., & Wehrheim, H. (2004). Linking
{CSP-OZ} with {UML} and Java: {A} Case Study. In E. A. Boiten, J. Derrick, &
G. Smith (Eds.), Integrated Formal Methods, 4th International Conference, {IFM}
2004, Canterbury, UK, April 4-7, 2004, Proceedings (pp. 267--286). https://doi.org/10.1007/978-3-540-24756-2_15'
bibtex: '@inproceedings{Möller_Olderog_Rasch_Wehrheim_2004, series={Lecture Notes
in Computer Science}, title={Linking {CSP-OZ} with {UML} and Java: {A} Case Study},
DOI={10.1007/978-3-540-24756-2_15},
booktitle={Integrated Formal Methods, 4th International Conference, {IFM} 2004,
Canterbury, UK, April 4-7, 2004, Proceedings}, author={Möller, Michael and Olderog,
Ernst-Rüdiger and Rasch, Holger and Wehrheim, Heike}, editor={A. Boiten, Eerke
and Derrick, John and Smith, GraemeEditors}, year={2004}, pages={267--286}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Möller, Michael, Ernst-Rüdiger Olderog, Holger Rasch, and Heike Wehrheim.
“Linking {CSP-OZ} with {UML} and Java: {A} Case Study.” In Integrated Formal
Methods, 4th International Conference, {IFM} 2004, Canterbury, UK, April 4-7,
2004, Proceedings, edited by Eerke A. Boiten, John Derrick, and Graeme Smith,
267--286. Lecture Notes in Computer Science, 2004. https://doi.org/10.1007/978-3-540-24756-2_15.'
ieee: 'M. Möller, E.-R. Olderog, H. Rasch, and H. Wehrheim, “Linking {CSP-OZ} with
{UML} and Java: {A} Case Study,” in Integrated Formal Methods, 4th International
Conference, {IFM} 2004, Canterbury, UK, April 4-7, 2004, Proceedings, 2004,
pp. 267--286.'
mla: 'Möller, Michael, et al. “Linking {CSP-OZ} with {UML} and Java: {A} Case Study.”
Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury,
UK, April 4-7, 2004, Proceedings, edited by Eerke A. Boiten et al., 2004,
pp. 267--286, doi:10.1007/978-3-540-24756-2_15.'
short: 'M. Möller, E.-R. Olderog, H. Rasch, H. Wehrheim, in: E. A. Boiten, J. Derrick,
G. Smith (Eds.), Integrated Formal Methods, 4th International Conference, {IFM}
2004, Canterbury, UK, April 4-7, 2004, Proceedings, 2004, pp. 267--286.'
date_created: 2018-06-14T06:47:35Z
date_updated: 2022-01-06T06:59:06Z
department:
- _id: '77'
doi: 10.1007/978-3-540-24756-2_15
editor:
- first_name: Eerke
full_name: A. Boiten, Eerke
last_name: A. Boiten
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Graeme
full_name: Smith, Graeme
last_name: Smith
page: 267--286
publication: Integrated Formal Methods, 4th International Conference, {IFM} 2004,
Canterbury, UK, April 4-7, 2004, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: 'Linking {CSP-OZ} with {UML} and Java: {A} Case Study'
type: conference
user_id: '29719'
year: '2004'
...
---
_id: '3235'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Refinement and Consistency in Multiview Models. In: B{\’{e}}zivin
J, Heckel R, eds. Language Engineering for Model-Driven Software Development,
29. February - 5. March 2004. Dagstuhl Seminar Proceedings. ; 2004.'
apa: Wehrheim, H. (2004). Refinement and Consistency in Multiview Models. In J.
B{\’{e}}zivin & R. Heckel (Eds.), Language Engineering for Model-Driven
Software Development, 29. February - 5. March 2004.
bibtex: '@inproceedings{Wehrheim_2004, series={Dagstuhl Seminar Proceedings}, title={Refinement
and Consistency in Multiview Models}, booktitle={Language Engineering for Model-Driven
Software Development, 29. February - 5. March 2004}, author={Wehrheim, Heike},
editor={B{\’{e}}zivin, Jean and Heckel, ReikoEditors}, year={2004}, collection={Dagstuhl
Seminar Proceedings} }'
chicago: Wehrheim, Heike. “Refinement and Consistency in Multiview Models.” In Language
Engineering for Model-Driven Software Development, 29. February - 5. March 2004,
edited by Jean B{\’{e}}zivin and Reiko Heckel. Dagstuhl Seminar Proceedings, 2004.
ieee: H. Wehrheim, “Refinement and Consistency in Multiview Models,” in Language
Engineering for Model-Driven Software Development, 29. February - 5. March 2004,
2004.
mla: Wehrheim, Heike. “Refinement and Consistency in Multiview Models.” Language
Engineering for Model-Driven Software Development, 29. February - 5. March 2004,
edited by Jean B{\’{e}}zivin and Reiko Heckel, 2004.
short: 'H. Wehrheim, in: J. B{\’{e}}zivin, R. Heckel (Eds.), Language Engineering
for Model-Driven Software Development, 29. February - 5. March 2004, 2004.'
date_created: 2018-06-14T06:48:55Z
date_updated: 2022-01-06T06:59:06Z
department:
- _id: '77'
editor:
- first_name: Jean
full_name: B{\'{e}}zivin, Jean
last_name: B{\'{e}}zivin
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
publication: Language Engineering for Model-Driven Software Development, 29. February
- 5. March 2004
series_title: Dagstuhl Seminar Proceedings
status: public
title: Refinement and Consistency in Multiview Models
type: conference
user_id: '29719'
year: '2004'
...
---
_id: '3011'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jorge
full_name: Guajardo, Jorge
last_name: Guajardo
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected
Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83.
doi:10.1007/978-3-540-30564-4_5'
apa: 'Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking
of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5'
bibtex: '@inbook{Blömer_Guajardo_Krummel_2004, place={Berlin, Heidelberg}, title={Provably
Secure Masking of AES}, DOI={10.1007/978-3-540-30564-4_5},
booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and Guajardo, Jorge and Krummel, Volker}, year={2004},
pages={69–83} }'
chicago: 'Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure
Masking of AES.” In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30564-4_5.'
ieee: 'J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,”
in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin
Heidelberg, 2004, pp. 69–83.'
mla: Blömer, Johannes, et al. “Provably Secure Masking of AES.” Selected Areas
in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.
short: 'J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.'
date_created: 2018-06-05T08:20:20Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-30564-4_5
page: 69-83
place: Berlin, Heidelberg
publication: Selected Areas in Cryptography
publication_identifier:
isbn:
- '9783540243274'
- '9783540305644'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Provably Secure Masking of AES
type: book_chapter
user_id: '25078'
year: '2004'
...
---
_id: '3012'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Alexander
full_name: May, Alexander
last_name: May
citation:
ama: 'Blömer J, May A. A Generalized Wiener Attack on RSA. In: Public Key Cryptography
– PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:10.1007/978-3-540-24632-9_1'
apa: 'Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public
Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin
Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1'
bibtex: '@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized
Wiener Attack on RSA}, DOI={10.1007/978-3-540-24632-9_1},
booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }'
chicago: 'Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”
In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-24632-9_1.'
ieee: 'J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public
Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg,
2004, pp. 1–13.'
mla: Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”
Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp.
1–13, doi:10.1007/978-3-540-24632-9_1.
short: 'J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.'
date_created: 2018-06-05T08:20:59Z
date_updated: 2022-01-06T06:58:51Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-540-24632-9_1
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:21:31Z
date_updated: 2018-06-05T08:21:31Z
file_id: '3013'
file_name: keys.pdf
file_size: 198120
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:21:31Z
has_accepted_license: '1'
page: 1-13
place: Berlin, Heidelberg
publication: Public Key Cryptography – PKC 2004
publication_identifier:
isbn:
- '9783540210184'
- '9783540246329'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: A Generalized Wiener Attack on RSA
type: book_chapter
user_id: '25078'
year: '2004'
...
---
_id: '3014'
author:
- first_name: Alexander
full_name: May, Alexander
last_name: May
citation:
ama: 'May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In:
Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2004:218-230. doi:10.1007/978-3-540-24632-9_16'
apa: 'May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q.
In Public Key Cryptography – PKC 2004 (pp. 218–230). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_16'
bibtex: '@inbook{May_2004, place={Berlin, Heidelberg}, title={Secret Exponent Attacks
on RSA-type Schemes with Moduli N=p^{r}q}, DOI={10.1007/978-3-540-24632-9_16},
booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg},
author={May, Alexander}, year={2004}, pages={218–230} }'
chicago: 'May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli
N=p^{r}q.” In Public Key Cryptography – PKC 2004, 218–30. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-24632-9_16.'
ieee: 'A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,”
in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin
Heidelberg, 2004, pp. 218–230.'
mla: May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.”
Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp.
218–30, doi:10.1007/978-3-540-24632-9_16.
short: 'A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2004, pp. 218–230.'
date_created: 2018-06-05T08:22:02Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-24632-9_16
page: 218-230
place: Berlin, Heidelberg
publication: Public Key Cryptography – PKC 2004
publication_identifier:
isbn:
- '9783540210184'
- '9783540246329'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q
type: book_chapter
user_id: '25078'
year: '2004'
...
---
_id: '3015'
author:
- first_name: Alexander
full_name: May, Alexander
last_name: May
citation:
ama: 'May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent
to Factoring. In: Advances in Cryptology – CRYPTO 2004. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2004:213-219. doi:10.1007/978-3-540-28628-8_13'
apa: 'May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time
Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_13'
bibtex: '@inbook{May_2004, place={Berlin, Heidelberg}, title={Computing the RSA
Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, DOI={10.1007/978-3-540-28628-8_13},
booktitle={Advances in Cryptology – CRYPTO 2004}, publisher={Springer Berlin Heidelberg},
author={May, Alexander}, year={2004}, pages={213–219} }'
chicago: 'May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial
Time Equivalent to Factoring.” In Advances in Cryptology – CRYPTO 2004,
213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-28628-8_13.'
ieee: 'A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent
to Factoring,” in Advances in Cryptology – CRYPTO 2004, Berlin, Heidelberg:
Springer Berlin Heidelberg, 2004, pp. 213–219.'
mla: May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time
Equivalent to Factoring.” Advances in Cryptology – CRYPTO 2004, Springer
Berlin Heidelberg, 2004, pp. 213–19, doi:10.1007/978-3-540-28628-8_13.
short: 'A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2004, pp. 213–219.'
date_created: 2018-06-05T08:23:43Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-28628-8_13
page: 213-219
place: Berlin, Heidelberg
publication: Advances in Cryptology – CRYPTO 2004
publication_identifier:
isbn:
- '9783540226680'
- '9783540286288'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to
Factoring
type: book_chapter
user_id: '25078'
year: '2004'
...
---
_id: '3017'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Martin
full_name: Otto, Martin
last_name: Otto
- first_name: Jean-Pierre
full_name: Seifert, Jean-Pierre
last_name: Seifert
citation:
ama: 'Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore
attacks. In: Proceedings of the 10th ACM Conference on Computer and Communication
Security - CCS ’03. ACM Press; 2004. doi:10.1145/948109.948151'
apa: Blömer, J., Otto, M., & Seifert, J.-P. (2004). A new CRT-RSA algorithm
secure against bellcore attacks. In Proceedings of the 10th ACM conference
on Computer and communication security - CCS ’03. ACM Press. https://doi.org/10.1145/948109.948151
bibtex: '@inproceedings{Blömer_Otto_Seifert_2004, title={A new CRT-RSA algorithm
secure against bellcore attacks}, DOI={10.1145/948109.948151},
booktitle={Proceedings of the 10th ACM conference on Computer and communication
security - CCS ’03}, publisher={ACM Press}, author={Blömer, Johannes and Otto,
Martin and Seifert, Jean-Pierre}, year={2004} }'
chicago: Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA
Algorithm Secure against Bellcore Attacks.” In Proceedings of the 10th ACM
Conference on Computer and Communication Security - CCS ’03. ACM Press, 2004.
https://doi.org/10.1145/948109.948151.
ieee: J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against
bellcore attacks,” in Proceedings of the 10th ACM conference on Computer and
communication security - CCS ’03, 2004.
mla: Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.”
Proceedings of the 10th ACM Conference on Computer and Communication Security
- CCS ’03, ACM Press, 2004, doi:10.1145/948109.948151.
short: 'J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference
on Computer and Communication Security - CCS ’03, ACM Press, 2004.'
date_created: 2018-06-05T08:24:48Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1145/948109.948151
publication: Proceedings of the 10th ACM conference on Computer and communication
security - CCS '03
publication_identifier:
isbn:
- '1581137389'
publication_status: published
publisher: ACM Press
status: public
title: A new CRT-RSA algorithm secure against bellcore attacks
type: conference
user_id: '25078'
year: '2004'
...
---
_id: '26992'
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Rührup S, Schindelhauer C. Traffic and Hop Efficient Position-Based Routing
Using a Cell Structure.; 2004.
apa: Rührup, S., & Schindelhauer, C. (2004). Traffic and Hop Efficient Position-based
Routing using a Cell Structure.
bibtex: '@book{Rührup_Schindelhauer_2004, place={Heinz Nixdorf Institut, Universität
Paderborn}, title={Traffic and Hop Efficient Position-based Routing using a Cell
Structure}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2004}
}'
chicago: Rührup, Stefan, and Christian Schindelhauer. Traffic and Hop Efficient
Position-Based Routing Using a Cell Structure. Heinz Nixdorf Institut, Universität
Paderborn, 2004.
ieee: S. Rührup and C. Schindelhauer, Traffic and Hop Efficient Position-based
Routing using a Cell Structure. Heinz Nixdorf Institut, Universität Paderborn,
2004.
mla: Rührup, Stefan, and Christian Schindelhauer. Traffic and Hop Efficient Position-Based
Routing Using a Cell Structure. 2004.
short: S. Rührup, C. Schindelhauer, Traffic and Hop Efficient Position-Based Routing
Using a Cell Structure, Heinz Nixdorf Institut, Universität Paderborn, 2004.
date_created: 2021-10-28T11:59:31Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2021-10-28T11:58:56Z
date_updated: 2021-10-28T11:58:56Z
file_id: '26993'
file_name: techreport-hniid-2024.pdf
file_size: 234517
relation: main_file
success: 1
file_date_updated: 2021-10-28T11:58:56Z
has_accepted_license: '1'
language:
- iso: eng
place: Heinz Nixdorf Institut, Universität Paderborn
status: public
title: Traffic and Hop Efficient Position-based Routing using a Cell Structure
type: report
user_id: '15415'
year: '2004'
...
---
_id: '20933'
abstract:
- lang: eng
text: Today, in software intensive projects a huge amount of the budget flows into
the analysis of the already existing system. The reason for the high costs results
mainly from the fact that analyses are often made manually or with automatic tool
support, which is inappropriate for analyzing large systems. Semi-automatic analysis
approaches usually use a notion of fuzziness to overcome this limitation, but
inherit the problem of selecting appropriate initial values. In this paper we
present an approach to adapt the initial values of our semi-automatic reverse
engineering process. We provide the reverse engineer with accuracy information
for results produced by a rule-based inference algorithm. Based on the changes
of the results done by the reverse engineer we automatically adapt a credibility
value of each rule, which previously has been used to compute the accuracy of
the result. The adaption fits seamlessly into our overall analysis process. First
tests show that it is suitable for the calibration of our fuzzyfied rule-based
pattern recognition approach.
author:
- first_name: Jörrg
full_name: Niere, Jörrg
last_name: Niere
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
- first_name: Lothar
full_name: Wendehals, Lothar
last_name: Wendehals
citation:
ama: Niere J, Meyer M, Wendehals L. User-Driven Adaption in Rule-Based Pattern
Recognition.; 2004.
apa: Niere, J., Meyer, M., & Wendehals, L. (2004). User-driven adaption in
rule-based pattern recognition.
bibtex: '@book{Niere_Meyer_Wendehals_2004, place={Paderborn, Germany}, title={User-driven
adaption in rule-based pattern recognition}, author={Niere, Jörrg and Meyer, Matthias
and Wendehals, Lothar}, year={2004} }'
chicago: Niere, Jörrg, Matthias Meyer, and Lothar Wendehals. User-Driven Adaption
in Rule-Based Pattern Recognition. Paderborn, Germany, 2004.
ieee: J. Niere, M. Meyer, and L. Wendehals, User-driven adaption in rule-based
pattern recognition. Paderborn, Germany, 2004.
mla: Niere, Jörrg, et al. User-Driven Adaption in Rule-Based Pattern Recognition.
2004.
short: J. Niere, M. Meyer, L. Wendehals, User-Driven Adaption in Rule-Based Pattern
Recognition, Paderborn, Germany, 2004.
date_created: 2021-01-13T10:00:00Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '76'
language:
- iso: eng
place: Paderborn, Germany
status: public
title: User-driven adaption in rule-based pattern recognition
type: report
user_id: '5786'
year: '2004'
...
---
_id: '2119'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint
Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1
apa: Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1
bibtex: '@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem}, DOI={10.1007/s00453-004-1086-1},
number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian},
year={2004}, pages={209--233} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233.
https://doi.org/10.1007/s00453-004-1086-1.'
ieee: P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint
Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.
mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233,
doi:10.1007/s00453-004-1086-1.
short: P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.
date_created: 2018-04-03T05:30:23Z
date_updated: 2022-01-06T06:54:49Z
department:
- _id: '79'
doi: 10.1007/s00453-004-1086-1
issue: '3'
page: 209--233
publication: Algorithmica
status: public
title: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
type: journal_article
user_id: '15504'
year: '2004'
...