---
_id: '613'
author:
- first_name: Stefan
full_name: Wohlfarth, Stefan
last_name: Wohlfarth
citation:
ama: Wohlfarth S. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung
mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn; 2012.
apa: Wohlfarth, S. (2012). Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn.
bibtex: '@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens},
publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }'
chicago: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
ieee: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in
Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
mla: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung
in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens.
Universität Paderborn, 2012.
short: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung
mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der
Analyse und Implementierung eines hydraulischen Simulationsverfahrens
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '6138'
author:
- first_name: W
full_name: Weber, W
last_name: Weber
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: Weber W, Kabst R. Einführung in Die Betriebswirtschaftslehre. 8th ed.
Wiesbaden; 2012.
apa: Weber, W., & Kabst, R. (2012). Einführung in die Betriebswirtschaftslehre
(8th ed.). Wiesbaden.
bibtex: '@book{Weber_Kabst_2012, place={Wiesbaden}, edition={8}, title={Einführung
in die Betriebswirtschaftslehre}, author={Weber, W and Kabst, Rüdiger}, year={2012}
}'
chicago: Weber, W, and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre.
8th ed. Wiesbaden, 2012.
ieee: W. Weber and R. Kabst, Einführung in die Betriebswirtschaftslehre,
8th ed. Wiesbaden, 2012.
mla: Weber, W., and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre.
8th ed., 2012.
short: W. Weber, R. Kabst, Einführung in Die Betriebswirtschaftslehre, 8th ed.,
Wiesbaden, 2012.
date_created: 2018-12-11T10:21:09Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
edition: '8'
language:
- iso: eng
place: Wiesbaden
publication_identifier:
isbn:
- 978-3-8349-1994-6
status: public
title: Einführung in die Betriebswirtschaftslehre
type: book
user_id: '46632'
year: '2012'
...
---
_id: '614'
author:
- first_name: Sebastian
full_name: Lehrig, Sebastian
last_name: Lehrig
citation:
ama: Lehrig S. Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn; 2012.
apa: Lehrig, S. (2012). Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn.
bibtex: '@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen},
publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }'
chicago: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn, 2012.
ieee: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn, 2012.
mla: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen.
Universität Paderborn, 2012.
short: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Empirischer, quantitativer Vergleich von Modelltransformationssprachen
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '6148'
author:
- first_name: M
full_name: Baum, M
last_name: Baum
- first_name: C
full_name: Schwens, C
last_name: Schwens
- first_name: R
full_name: Kabst, R
last_name: Kabst
citation:
ama: 'Baum M, Schwens C, Kabst R. Determinants of Different Types of Born Globals.
In: Gabrielsson M, Kirpalani M, eds. Handbook of Research on Born Globals.
Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.; 2012:36-45.'
apa: 'Baum, M., Schwens, C., & Kabst, R. (2012). Determinants of Different Types
of Born Globals. In M. Gabrielsson & M. Kirpalani (Eds.), Handbook of Research
on Born Globals (pp. 36–45). Cheltenham Glos/Northampton: Edward Elgar Publishing
Ltd.'
bibtex: '@inbook{Baum_Schwens_Kabst_2012, place={Cheltenham Glos/Northampton}, title={Determinants
of Different Types of Born Globals.}, booktitle={Handbook of Research on Born
Globals}, publisher={Edward Elgar Publishing Ltd.}, author={Baum, M and Schwens,
C and Kabst, R}, editor={Gabrielsson, M and Kirpalani, MEditors}, year={2012},
pages={36–45} }'
chicago: 'Baum, M, C Schwens, and R Kabst. “Determinants of Different Types of Born
Globals.” In Handbook of Research on Born Globals, edited by M Gabrielsson
and M Kirpalani, 36–45. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.,
2012.'
ieee: 'M. Baum, C. Schwens, and R. Kabst, “Determinants of Different Types of Born
Globals.,” in Handbook of Research on Born Globals, M. Gabrielsson and
M. Kirpalani, Eds. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.,
2012, pp. 36–45.'
mla: Baum, M., et al. “Determinants of Different Types of Born Globals.” Handbook
of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, Edward
Elgar Publishing Ltd., 2012, pp. 36–45.
short: 'M. Baum, C. Schwens, R. Kabst, in: M. Gabrielsson, M. Kirpalani (Eds.),
Handbook of Research on Born Globals, Edward Elgar Publishing Ltd., Cheltenham
Glos/Northampton, 2012, pp. 36–45.'
date_created: 2018-12-11T11:02:56Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
editor:
- first_name: M
full_name: Gabrielsson, M
last_name: Gabrielsson
- first_name: M
full_name: Kirpalani, M
last_name: Kirpalani
language:
- iso: eng
page: 36-45
place: Cheltenham Glos/Northampton
publication: Handbook of Research on Born Globals
publisher: Edward Elgar Publishing Ltd.
status: public
title: Determinants of Different Types of Born Globals.
type: book_chapter
user_id: '46632'
year: '2012'
...
---
_id: '6149'
author:
- first_name: R
full_name: Isidor, R
last_name: Isidor
- first_name: C
full_name: Schwens, C
last_name: Schwens
- first_name: R
full_name: Kabst, R
last_name: Kabst
citation:
ama: 'Isidor R, Schwens C, Kabst R. Die Messung von Joint-Venture Erfolg. In: Zentes
J, ed. Markteintrittsstrategien - Dynamik Und Komplexität. ; 2012:193-205.'
apa: Isidor, R., Schwens, C., & Kabst, R. (2012). Die Messung von Joint-Venture
Erfolg. In J. Zentes (Ed.), Markteintrittsstrategien - Dynamik und Komplexität
(pp. 193–205).
bibtex: '@inbook{Isidor_Schwens_Kabst_2012, title={Die Messung von Joint-Venture
Erfolg}, booktitle={Markteintrittsstrategien - Dynamik und Komplexität}, author={Isidor,
R and Schwens, C and Kabst, R}, editor={Zentes, JEditor}, year={2012}, pages={193–205}
}'
chicago: Isidor, R, C Schwens, and R Kabst. “Die Messung von Joint-Venture Erfolg.”
In Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes,
193–205, 2012.
ieee: R. Isidor, C. Schwens, and R. Kabst, “Die Messung von Joint-Venture Erfolg,”
in Markteintrittsstrategien - Dynamik und Komplexität, J. Zentes, Ed. 2012,
pp. 193–205.
mla: Isidor, R., et al. “Die Messung von Joint-Venture Erfolg.” Markteintrittsstrategien
- Dynamik Und Komplexität, edited by J Zentes, 2012, pp. 193–205.
short: 'R. Isidor, C. Schwens, R. Kabst, in: J. Zentes (Ed.), Markteintrittsstrategien
- Dynamik Und Komplexität, 2012, pp. 193–205.'
date_created: 2018-12-11T11:06:03Z
date_updated: 2022-01-06T07:02:53Z
department:
- _id: '274'
editor:
- first_name: J
full_name: Zentes, J
last_name: Zentes
language:
- iso: eng
page: 193-205
publication: Markteintrittsstrategien - Dynamik und Komplexität
publication_identifier:
isbn:
- 978-3-8349-3503-8
status: public
title: Die Messung von Joint-Venture Erfolg
type: book_chapter
user_id: '46632'
year: '2012'
...
---
_id: '616'
author:
- first_name: Sven
full_name: Kluczniok, Sven
last_name: Kluczniok
citation:
ama: Kluczniok S. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn; 2012.
apa: Kluczniok, S. (2012). Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn.
bibtex: '@book{Kluczniok_2012, title={Effiziente Paketbildung in mehrdimensionalen
Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Kluczniok,
Sven}, year={2012} }'
chicago: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn, 2012.
ieee: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn, 2012.
mla: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen.
Universität Paderborn, 2012.
short: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:54Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '617'
abstract:
- lang: eng
text: In this paper, a color based feature extraction and classification approach
for image processing in embedded systems in presented. The algorithms and data
structures developed for this approach pay particular attention to reduce memory
consumption and computation power of the entire image processing, since embedded
systems usually impose strong restrictions regarding those resources. The feature
extraction is realized in terms of an image segmentation algorithm. The criteria
of homogeneity for merging pixels and regions is provided by the color classification
mechanism, which incorporates appropriate methods for defining, representing and
accessing subspaces in the working color space. By doing so, pixels and regions
with color values that belong to the same color class can be merged. Furthermore,
pixels with redundant color values that do not belong to any pre-defined color
class can be completely discarded in order to minimize computational effort. Subsequently,
the extracted regions are converted to a more convenient feature representation
in terms of statistical moments up to and including second order. For evaluation,
the whole image processing approach is applied to a mobile representative of embedded
systems within the scope of a simple real-world scenario.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Bernd
full_name: Kleinjohann, Bernd
last_name: Kleinjohann
- first_name: Elisabeth
full_name: Kleinjohann, Elisabeth
id: '15588'
last_name: Kleinjohann
- first_name: Maarten
full_name: Bieshaar, Maarten
last_name: Bieshaar
citation:
ama: 'Jungmann A, Kleinjohann B, Kleinjohann E, Bieshaar M. Efficient Color-Based
Image Segmentation and Feature Classification for Image Processing in Embedded
Systems. In: Proceedings of the Fourth International Conference on Resource
Intensive Applications and Services (INTENSIVE). ; 2012:22-29.'
apa: Jungmann, A., Kleinjohann, B., Kleinjohann, E., & Bieshaar, M. (2012).
Efficient Color-Based Image Segmentation and Feature Classification for Image
Processing in Embedded Systems. In Proceedings of the Fourth International
Conference on Resource Intensive Applications and Services (INTENSIVE) (pp.
22–29).
bibtex: '@inproceedings{Jungmann_Kleinjohann_Kleinjohann_Bieshaar_2012, title={Efficient
Color-Based Image Segmentation and Feature Classification for Image Processing
in Embedded Systems}, booktitle={Proceedings of the Fourth International Conference
on Resource Intensive Applications and Services (INTENSIVE)}, author={Jungmann,
Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten},
year={2012}, pages={22–29} }'
chicago: Jungmann, Alexander, Bernd Kleinjohann, Elisabeth Kleinjohann, and Maarten
Bieshaar. “Efficient Color-Based Image Segmentation and Feature Classification
for Image Processing in Embedded Systems.” In Proceedings of the Fourth International
Conference on Resource Intensive Applications and Services (INTENSIVE), 22–29,
2012.
ieee: A. Jungmann, B. Kleinjohann, E. Kleinjohann, and M. Bieshaar, “Efficient Color-Based
Image Segmentation and Feature Classification for Image Processing in Embedded
Systems,” in Proceedings of the Fourth International Conference on Resource
Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29.
mla: Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature
Classification for Image Processing in Embedded Systems.” Proceedings of the
Fourth International Conference on Resource Intensive Applications and Services
(INTENSIVE), 2012, pp. 22–29.
short: 'A. Jungmann, B. Kleinjohann, E. Kleinjohann, M. Bieshaar, in: Proceedings
of the Fourth International Conference on Resource Intensive Applications and
Services (INTENSIVE), 2012, pp. 22–29.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:55Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:47:50Z
date_updated: 2018-03-15T06:47:50Z
file_id: '1245'
file_name: 617-INTENSIVE2012-Jungmann.pdf
file_size: 2787964
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:47:50Z
has_accepted_license: '1'
page: 22-29
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Fourth International Conference on Resource Intensive
Applications and Services (INTENSIVE)
related_material:
link:
- relation: confirmation
url: http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031
status: public
title: Efficient Color-Based Image Segmentation and Feature Classification for Image
Processing in Embedded Systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '618'
author:
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
citation:
ama: Kurras S. Distributed Sampling of Regular Graphs. Universität Paderborn;
2012.
apa: Kurras, S. (2012). Distributed Sampling of Regular Graphs. Universität
Paderborn.
bibtex: '@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität
Paderborn}, author={Kurras, Sven}, year={2012} }'
chicago: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität
Paderborn, 2012.
ieee: S. Kurras, Distributed Sampling of Regular Graphs. Universität Paderborn,
2012.
mla: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn,
2012.
short: S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn,
2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:55Z
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Distributed Sampling of Regular Graphs
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '619'
abstract:
- lang: eng
text: 'Dynamics in networks is caused by a variety of reasons, like nodes moving
in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer
networks, evolution in social networks, and many others. In order to understand
such kinds of dynamics, and to design distributed algorithms that behave well
under dynamics, many ways to model dynamics are introduced and analyzed w.r.t.
correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman
have introduced a very general, worst case type model of dynamics: The edge set
of the network may change arbitrarily from step to step, the only restriction
is that it is connected at all times and the set of nodes does not change. An
extended model demands that a xed connected subnetwork is maintained over each
time interval of length T (T-interval dynamics). They have presented, among others,
algorithms for counting the number of nodes under such general models of dynamics.In
this paper, we generalize their models and algorithms by adding random edge faults,
i.e., we consider fault-prone dynamic networks: We assume that an edge currently
existing may fail to transmit data with some probability p. We rst observe that
strong counting, i.e., each node knows the correct count and stops, is not possible
in a model with random edge faults. Our main two positive results are feasibility
and runtime bounds for weak counting, i.e., stopping is no longer required (but
still a correct count in each node), and for strong counting with an upper bound,
i.e., an upper bound N on n is known to all nodes.'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic
Networks. In: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic
Distributed Systems (TADDS). ICPS. ; 2012:9-14. doi:10.1145/2414815.2414818'
apa: Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in
Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818
bibtex: '@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed
Computing in Fault-Prone Dynamic Networks}, DOI={10.1145/2414815.2414818},
booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm},
year={2012}, pages={9–14}, collection={ICPS} }'
chicago: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
in Fault-Prone Dynamic Networks.” In Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS), 9–14. ICPS, 2012. https://doi.org/10.1145/2414815.2414818.
ieee: P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone
Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects
of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.
mla: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818.
short: 'P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop
on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2414815.2414818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:47:15Z
date_updated: 2018-03-15T06:47:15Z
file_id: '1244'
file_name: 619-Brandes_MadHTADDS12_01.pdf
file_size: 346044
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:47:15Z
has_accepted_license: '1'
page: 9-14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
Systems (TADDS)
series_title: ICPS
status: public
title: Distributed Computing in Fault-Prone Dynamic Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '620'
author:
- first_name: Robert
full_name: Mittendorf, Robert
last_name: Mittendorf
citation:
ama: Mittendorf R. Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn; 2012.
apa: Mittendorf, R. (2012). Datenschutzgerechtes DRM im Cloud Computing.
Universität Paderborn.
bibtex: '@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing},
publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }'
chicago: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing.
Universität Paderborn, 2012.
ieee: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn, 2012.
mla: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität
Paderborn, 2012.
short: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn,
2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Datenschutzgerechtes DRM im Cloud Computing
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '621'
author:
- first_name: Stephan
full_name: Sekula, Stephan
last_name: Sekula
citation:
ama: Sekula S. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn; 2012.
apa: Sekula, S. (2012). Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing. Universität Paderborn.
bibtex: '@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012}
}'
chicago: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly
Computing. Universität Paderborn, 2012.
ieee: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn, 2012.
mla: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing.
Universität Paderborn, 2012.
short: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:57Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '622'
abstract:
- lang: eng
text: Behavioral modeling languages are most useful if their behavior is specified
formally such that it can e.g. be analyzed and executed automatically. Obviously,
the quality of such behavior specifications is crucial. The rule-based semantics
specification technique Dynamic Meta Modeling (DMM) honors this by using the approach
of Test-driven Semantics Specification (TDSS), which makes sure that the specification
at hand at least describes the correct behavior for a suite of test models. However,
in its current state TDSS does not provide any means to measure the quality of
such a test suite. In this paper, we describe how we have applied the idea of
test coverage to TDSS. Similar to common approaches of defining test coverage
criteria, we describe a data structure called invocation graph containing possible
orders of applications ofDMM rules. Then we define different coverage criteria
based on that data structure, taking the rule applications caused by the test
suite’s models into account. Our implementation of the described approach gives
the language engineer using DMM a means to reason about the quality of the language’s
test suite, and also provides hints on how to improve that quality by adding dedicated
test models to the test suite.
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
citation:
ama: 'Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications.
In: Proceedings of the 11th International Workshop on Graph Transformation
and Visual Modeling Techniques (GT-VMT). Electronic Communications of the
EASST. ; 2012. doi:10.14279/tuj.eceasst.47.718'
apa: Arifulina, S., Engels, G., & Soltenborn, C. (2012). Coverage Criteria for
Testing DMM Specifications. In Proceedings of the 11th International Workshop
on Graph Transformation and Visual Modeling Techniques (GT-VMT). https://doi.org/10.14279/tuj.eceasst.47.718
bibtex: '@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications
of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={10.14279/tuj.eceasst.47.718},
booktitle={Proceedings of the 11th International Workshop on Graph Transformation
and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels,
Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications
of the EASST} }'
chicago: Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage
Criteria for Testing DMM Specifications.” In Proceedings of the 11th International
Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT).
Electronic Communications of the EASST, 2012. https://doi.org/10.14279/tuj.eceasst.47.718.
ieee: S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing
DMM Specifications,” in Proceedings of the 11th International Workshop on Graph
Transformation and Visual Modeling Techniques (GT-VMT), 2012.
mla: Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.”
Proceedings of the 11th International Workshop on Graph Transformation and
Visual Modeling Techniques (GT-VMT), 2012, doi:10.14279/tuj.eceasst.47.718.
short: 'S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International
Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:57Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.14279/tuj.eceasst.47.718
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:46:40Z
date_updated: 2018-03-15T06:46:40Z
file_id: '1243'
file_name: 622-gtvmt2012-Arifulina_01.pdf
file_size: 301602
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:46:40Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Workshop on Graph Transformation
and Visual Modeling Techniques (GT-VMT)
series_title: Electronic Communications of the EASST
status: public
title: Coverage Criteria for Testing DMM Specifications
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '623'
abstract:
- lang: eng
text: 'This paper initiates the formal study of a fundamental problem: How to efficiently
allocate a shared communication medium among a set of K co-existing networks in
the presence of arbitrary external interference? While most literature on medium
access focuses on how to share a medium among nodes, these approaches are often
either not directly applicable to co-existing networks as they would violate the
independence requirement, or they yield a low throughput if applied to multiple
networks. We present the randomized medium access (MAC) protocol COMAC which guarantees
that a given communication channel is shared fairly among competing and independent
networks, and that the available bandwidth is used efficiently. These performance
guarantees hold in the presence of arbitrary external interference or even under
adversarial jamming. Concretely, we show that the co-existing networks can use
a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful
message transmissions, where ε is the (arbitrarily distributed) fraction of time
which is not jammed.'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Jin '
full_name: 'Zhang, Jin '
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput
for co-existing networks under adversarial interference. In: Proceedings of
the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC). ; 2012:291-300. doi:10.1145/2332432.2332488'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive
and fair throughput for co-existing networks under adversarial interference. In
Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and
Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and
fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin }, year={2012}, pages={291–300} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang.
“Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”
In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair
throughput for co-existing networks under adversarial interference,” in Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC), 2012, pp. 291–300.
mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks
under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS
Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300,
doi:10.1145/2332432.2332488.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st
Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC),
2012, pp. 291–300.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2332432.2332488
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:45:25Z
date_updated: 2018-03-15T06:45:25Z
file_id: '1241'
file_name: 623-PODC-2012_01.pdf
file_size: 210382
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:45:25Z
has_accepted_license: '1'
page: 291-300
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC)
status: public
title: Competitive and fair throughput for co-existing networks under adversarial
interference
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '624'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: Jakobs M-C. Change and Validity Analysis in Deductive Program Verification.
Universität Paderborn; 2012.
apa: Jakobs, M.-C. (2012). Change and Validity Analysis in Deductive Program
Verification. Universität Paderborn.
bibtex: '@book{Jakobs_2012, title={Change and Validity Analysis in Deductive Program
Verification}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine},
year={2012} }'
chicago: Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program
Verification. Universität Paderborn, 2012.
ieee: M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification.
Universität Paderborn, 2012.
mla: Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program
Verification. Universität Paderborn, 2012.
short: M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Change and Validity Analysis in Deductive Program Verification
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '625'
abstract:
- lang: eng
text: 'This paper initiates the study of self-adjusting distributed data structures
for networks. In particular, we present SplayNets: a binary search tree based
network that is self-adjusting to routing request.We derive entropy bounds on
the amortized routing cost and show that our splaying algorithm has some interesting
properties.'
author:
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Bernhard
full_name: Häupler, Bernhard
last_name: Häupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
citation:
ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets
- Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the
26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440.
doi:10.1007/978-3-642-33651-5_47'
apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012).
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.
In Proceedings of the 26th International Symposium on Distributed Computing
(DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47'
bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS},
title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data
Structures}, DOI={10.1007/978-3-642-33651-5_47},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler,
Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }'
chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and
Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed
Data Structures.” In Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.'
ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement:
SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012,
pp. 439–440.'
mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting
Distributed Data Structures.” Proceedings of the 26th International Symposium
on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.'
short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012, pp.
439–440.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_47
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:44:09Z
date_updated: 2018-03-15T06:44:09Z
file_id: '1240'
file_name: 625-disc12adjBAshort.pdf
file_size: 717284
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:44:09Z
has_accepted_license: '1'
page: 439-440
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '6250'
author:
- first_name: Volker
full_name: Paelke, Volker
last_name: Paelke
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
- first_name: Christian
full_name: Geiger, Christian
last_name: Geiger
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
citation:
ama: Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Multi-Modal, Multi-Touch
Interaction with Maps in Disaster Management Applications. ISPRS - International
Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences.
2012;XXXIX-B8:55-60. doi:10.5194/isprsarchives-xxxix-b8-55-2012
apa: Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., & Fischer, H. G. (2012).
Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.
ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial
Information Sciences, XXXIX-B8, 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012
bibtex: '@article{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Multi-Modal,
Multi-Touch Interaction with Maps in Disaster Management Applications}, volume={XXXIX-B8},
DOI={10.5194/isprsarchives-xxxix-b8-55-2012},
journal={ISPRS - International Archives of the Photogrammetry, Remote Sensing
and Spatial Information Sciences}, publisher={Copernicus GmbH}, author={Paelke,
Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer,
Holger Gerhard}, year={2012}, pages={55–60} }'
chicago: 'Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and
Holger Gerhard Fischer. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster
Management Applications.” ISPRS - International Archives of the Photogrammetry,
Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012): 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012.'
ieee: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Multi-Modal,
Multi-Touch Interaction with Maps in Disaster Management Applications,” ISPRS
- International Archives of the Photogrammetry, Remote Sensing and Spatial Information
Sciences, vol. XXXIX-B8, pp. 55–60, 2012.
mla: Paelke, Volker, et al. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster
Management Applications.” ISPRS - International Archives of the Photogrammetry,
Remote Sensing and Spatial Information Sciences, vol. XXXIX-B8, Copernicus
GmbH, 2012, pp. 55–60, doi:10.5194/isprsarchives-xxxix-b8-55-2012.
short: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, ISPRS - International
Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
XXXIX-B8 (2012) 55–60.
date_created: 2018-12-18T10:18:13Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.5194/isprsarchives-xxxix-b8-55-2012
language:
- iso: eng
page: 55-60
publication: ISPRS - International Archives of the Photogrammetry, Remote Sensing
and Spatial Information Sciences
publication_identifier:
issn:
- 1682-1777
publication_status: published
publisher: Copernicus GmbH
status: public
title: Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications
type: journal_article
user_id: '30457'
volume: XXXIX-B8
year: '2012'
...
---
_id: '626'
abstract:
- lang: eng
text: The design of ecient search structures for peer-to-peer systems has attracted
a lot of attention in recent years. In this announcement we address the problem
of nding the predecessor in a key set and present an ecient data structure called
hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports
PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses
when u is the size of the universe of the keys. That is the costs only depend
on u and not the size of the data structure. One feature of our approach is that
it only uses the lookup interface of the hash table and therefore hash table accesses
may be realized by any distributed hash table (DHT).
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia
Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.
In: Proceedings of the 26th International Symposium on Distributed Computing
(DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45'
apa: 'Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems. In Proceedings of the 26th International Symposium on Distributed
Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45'
bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief
Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient
Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012},
pages={435–436}, collection={LNCS} }'
chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement:
Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor
Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.'
ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems,” in Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 2012, pp. 435–436.'
mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed
Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries
in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on
Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.'
short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 2012, pp. 435–436.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_45
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:42:40Z
date_updated: 2018-03-15T06:42:40Z
file_id: '1239'
file_name: 626-Predecessor-Kniesburges_Scheideler.pdf
file_size: 184095
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:42:40Z
has_accepted_license: '1'
page: 435-436
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for
Efficient Predecessor Queries in Peer-to-Peer Systems'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '627'
abstract:
- lang: eng
text: Block Abstraction Memoization (ABM) is a technique in software model checking
that exploits the modularity of programs during verification by caching. To this
end, ABM records the results of block analyses and reuses them if possible when
revisiting the same block again. In this paper we present an implementation of
ABM into the predicate-analysis component of the software-verification framework
CPAchecker. With our participation at the Competition on Software Verification
we aim at providing evidence that ABM can not only substantially increase the
efficiency of predicate analysis but also enables verification of a wider range
of programs.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Wonisch D. Block Abstraction Memoization for CPAchecker. In: Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS). LNCS. ; 2012:531-533. doi:10.1007/978-3-642-28756-5_41'
apa: Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS) (pp. 531–533). https://doi.org/10.1007/978-3-642-28756-5_41
bibtex: '@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization
for CPAchecker}, DOI={10.1007/978-3-642-28756-5_41},
booktitle={Proceedings of the 18th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel},
year={2012}, pages={531–533}, collection={LNCS} }'
chicago: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS), 531–33. LNCS, 2012. https://doi.org/10.1007/978-3-642-28756-5_41.
ieee: D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS), 2012, pp. 531–533.
mla: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” Proceedings
of the 18th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (TACAS), 2012, pp. 531–33, doi:10.1007/978-3-642-28756-5_41.
short: 'D. Wonisch, in: Proceedings of the 18th International Conference on Tools
and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp.
531–533.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-28756-5_41
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:46:05Z
date_updated: 2018-03-15T06:46:05Z
file_id: '1242'
file_name: 627-WonischSV-Comp2012_01.pdf
file_size: 184000
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:46:05Z
has_accepted_license: '1'
language:
- iso: eng
page: 531-533
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 18th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems (TACAS)
series_title: LNCS
status: public
title: Block Abstraction Memoization for CPAchecker
type: conference
user_id: '477'
year: '2012'
...
---
_id: '6275'
author:
- first_name: M
full_name: Schneid, M
last_name: Schneid
- first_name: Holger
full_name: Steinmetz, Holger
id: '43261'
last_name: Steinmetz
- first_name: R
full_name: Isidor, R
last_name: Isidor
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: 'Schneid M, Steinmetz H, Isidor R, Kabst R. Diversität, Konflikte und Leistung
in Teams: Ein meta-analytisches Strukturgleichungsmodell. In: ; 2012.'
apa: 'Schneid, M., Steinmetz, H., Isidor, R., & Kabst, R. (2012). Diversität,
Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell.'
bibtex: '@inproceedings{Schneid_Steinmetz_Isidor_Kabst_2012, title={Diversität,
Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell},
author={Schneid, M and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}, year={2012}
}'
chicago: 'Schneid, M, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Diversität,
Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell,”
2012.'
ieee: 'M. Schneid, H. Steinmetz, R. Isidor, and R. Kabst, “Diversität, Konflikte
und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell,” 2012.'
mla: 'Schneid, M., et al. Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches
Strukturgleichungsmodell. 2012.'
short: 'M. Schneid, H. Steinmetz, R. Isidor, R. Kabst, in: 2012.'
date_created: 2018-12-18T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
department:
- _id: '274'
language:
- iso: eng
status: public
title: 'Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell'
type: conference
user_id: '46632'
year: '2012'
...
---
_id: '6277'
author:
- first_name: Rüdiger
full_name: Kabst, Rüdiger
id: '42362'
last_name: Kabst
citation:
ama: 'Kabst R. Endogeneity in the behavioral sciences: An illustration with real
data. In: Amsterdam; 2012.'
apa: 'Kabst, R. (2012). Endogeneity in the behavioral sciences: An illustration
with real data. Amsterdam.'
bibtex: '@inproceedings{Kabst_2012, place={Amsterdam}, title={Endogeneity in the
behavioral sciences: An illustration with real data}, author={Kabst, Rüdiger},
year={2012} }'
chicago: 'Kabst, Rüdiger. “Endogeneity in the Behavioral Sciences: An Illustration
with Real Data.” Amsterdam, 2012.'
ieee: 'R. Kabst, “Endogeneity in the behavioral sciences: An illustration with real
data,” 2012.'
mla: 'Kabst, Rüdiger. Endogeneity in the Behavioral Sciences: An Illustration
with Real Data. 2012.'
short: 'R. Kabst, in: Amsterdam, 2012.'
date_created: 2018-12-18T12:43:58Z
date_updated: 2022-01-06T07:02:59Z
department:
- _id: '274'
language:
- iso: eng
place: Amsterdam
status: public
title: 'Endogeneity in the behavioral sciences: An illustration with real data'
type: conference
user_id: '46632'
year: '2012'
...