---
_id: '4600'
author:
- first_name: Zhichao
full_name: Guo, Zhichao
last_name: Guo
- first_name: Yuanhua
full_name: Feng, Yuanhua
id: '20760'
last_name: Feng
citation:
ama: Guo Z, Feng Y. Modeling of the impact of the financial crisis and China’s accession
to WTO on China’s exports to Germany. Economic Modelling. 2013;31:474-483.
doi:10.1016/j.econmod.2012.12.015
apa: Guo, Z., & Feng, Y. (2013). Modeling of the impact of the financial crisis
and China’s accession to WTO on China’s exports to Germany. Economic Modelling,
31, 474–483. https://doi.org/10.1016/j.econmod.2012.12.015
bibtex: '@article{Guo_Feng_2013, title={Modeling of the impact of the financial
crisis and China’s accession to WTO on China’s exports to Germany}, volume={31},
DOI={10.1016/j.econmod.2012.12.015},
journal={Economic Modelling}, publisher={Elsevier BV}, author={Guo, Zhichao and
Feng, Yuanhua}, year={2013}, pages={474–483} }'
chicago: 'Guo, Zhichao, and Yuanhua Feng. “Modeling of the Impact of the Financial
Crisis and China’s Accession to WTO on China’s Exports to Germany.” Economic
Modelling 31 (2013): 474–83. https://doi.org/10.1016/j.econmod.2012.12.015.'
ieee: Z. Guo and Y. Feng, “Modeling of the impact of the financial crisis and China’s
accession to WTO on China’s exports to Germany,” Economic Modelling, vol.
31, pp. 474–483, 2013.
mla: Guo, Zhichao, and Yuanhua Feng. “Modeling of the Impact of the Financial Crisis
and China’s Accession to WTO on China’s Exports to Germany.” Economic Modelling,
vol. 31, Elsevier BV, 2013, pp. 474–83, doi:10.1016/j.econmod.2012.12.015.
short: Z. Guo, Y. Feng, Economic Modelling 31 (2013) 474–483.
date_created: 2018-10-10T09:56:47Z
date_updated: 2022-01-06T07:01:14Z
department:
- _id: '206'
doi: 10.1016/j.econmod.2012.12.015
intvolume: ' 31'
language:
- iso: eng
page: 474-483
publication: Economic Modelling
publication_identifier:
issn:
- 0264-9993
publication_status: published
publisher: Elsevier BV
status: public
title: Modeling of the impact of the financial crisis and China's accession to WTO
on China's exports to Germany
type: journal_article
user_id: '10075'
volume: 31
year: '2013'
...
---
_id: '4628'
author:
- first_name: Jan
full_name: Beran, Jan
last_name: Beran
- first_name: Yuanhua
full_name: Feng, Yuanhua
id: '20760'
last_name: Feng
- first_name: Sucharita
full_name: Ghosh, Sucharita
last_name: Ghosh
- first_name: Rafal
full_name: Kulik, Rafal
last_name: Kulik
citation:
ama: 'Beran J, Feng Y, Ghosh S, Kulik R. Long-Memory Processes. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2013. doi:10.1007/978-3-642-35512-7'
apa: 'Beran, J., Feng, Y., Ghosh, S., & Kulik, R. (2013). Long-Memory Processes.
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-35512-7'
bibtex: '@book{Beran_Feng_Ghosh_Kulik_2013, place={Berlin, Heidelberg}, title={Long-Memory
Processes}, DOI={10.1007/978-3-642-35512-7},
publisher={Springer Berlin Heidelberg}, author={Beran, Jan and Feng, Yuanhua and
Ghosh, Sucharita and Kulik, Rafal}, year={2013} }'
chicago: 'Beran, Jan, Yuanhua Feng, Sucharita Ghosh, and Rafal Kulik. Long-Memory
Processes. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-35512-7.'
ieee: 'J. Beran, Y. Feng, S. Ghosh, and R. Kulik, Long-Memory Processes.
Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.'
mla: Beran, Jan, et al. Long-Memory Processes. Springer Berlin Heidelberg,
2013, doi:10.1007/978-3-642-35512-7.
short: J. Beran, Y. Feng, S. Ghosh, R. Kulik, Long-Memory Processes, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2013.
date_created: 2018-10-10T11:40:15Z
date_updated: 2022-01-06T07:01:15Z
department:
- _id: '206'
doi: 10.1007/978-3-642-35512-7
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642355110'
- '9783642355127'
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Long-Memory Processes
type: book
user_id: '10075'
year: '2013'
...
---
_id: '4657'
author:
- first_name: Yuanhua
full_name: Feng, Yuanhua
id: '20760'
last_name: Feng
- first_name: Lixin
full_name: Sun, Lixin
last_name: Sun
citation:
ama: Feng Y, Sun L. A Semi-APARCH Approach for Comparing Long-Term and Short-Term
Risk in Chinese Financial Market and in Mature Financial Markets.; 2013.
apa: Feng, Y., & Sun, L. (2013). A Semi-APARCH approach for comparing long-term
and short-term risk in Chinese financial market and in mature financial markets.
bibtex: '@book{Feng_Sun_2013, title={A Semi-APARCH approach for comparing long-term
and short-term risk in Chinese financial market and in mature financial markets},
author={Feng, Yuanhua and Sun, Lixin}, year={2013} }'
chicago: Feng, Yuanhua, and Lixin Sun. A Semi-APARCH Approach for Comparing Long-Term
and Short-Term Risk in Chinese Financial Market and in Mature Financial Markets,
2013.
ieee: Y. Feng and L. Sun, A Semi-APARCH approach for comparing long-term and
short-term risk in Chinese financial market and in mature financial markets.
2013.
mla: Feng, Yuanhua, and Lixin Sun. A Semi-APARCH Approach for Comparing Long-Term
and Short-Term Risk in Chinese Financial Market and in Mature Financial Markets.
2013.
short: Y. Feng, L. Sun, A Semi-APARCH Approach for Comparing Long-Term and Short-Term
Risk in Chinese Financial Market and in Mature Financial Markets, 2013.
date_created: 2018-10-11T11:18:10Z
date_updated: 2022-01-06T07:01:16Z
department:
- _id: '206'
- _id: '475'
language:
- iso: eng
status: public
title: A Semi-APARCH approach for comparing long-term and short-term risk in Chinese
financial market and in mature financial markets
type: working_paper
user_id: '10075'
year: '2013'
...
---
_id: '4658'
author:
- first_name: Yuanhua
full_name: Feng, Yuanhua
id: '20760'
last_name: Feng
citation:
ama: Feng Y. Double-Conditional Smoothing of High-Frequency Volatility Surface
in a Spatial Multiplicative Component GARCH with Random Effects.; 2013.
apa: Feng, Y. (2013). Double-conditional smoothing of high-frequency volatility
surface in a spatial multiplicative component GARCH with random effects.
bibtex: '@book{Feng_2013, title={Double-conditional smoothing of high-frequency
volatility surface in a spatial multiplicative component GARCH with random effects},
author={Feng, Yuanhua}, year={2013} }'
chicago: Feng, Yuanhua. Double-Conditional Smoothing of High-Frequency Volatility
Surface in a Spatial Multiplicative Component GARCH with Random Effects, 2013.
ieee: Y. Feng, Double-conditional smoothing of high-frequency volatility surface
in a spatial multiplicative component GARCH with random effects. 2013.
mla: Feng, Yuanhua. Double-Conditional Smoothing of High-Frequency Volatility
Surface in a Spatial Multiplicative Component GARCH with Random Effects. 2013.
short: Y. Feng, Double-Conditional Smoothing of High-Frequency Volatility Surface
in a Spatial Multiplicative Component GARCH with Random Effects, 2013.
date_created: 2018-10-11T11:19:17Z
date_updated: 2022-01-06T07:01:17Z
department:
- _id: '206'
- _id: '475'
language:
- iso: eng
status: public
title: Double-conditional smoothing of high-frequency volatility surface in a spatial
multiplicative component GARCH with random effects
type: working_paper
user_id: '10075'
year: '2013'
...
---
_id: '469'
abstract:
- lang: eng
text: Runtime monitoring aims at ensuring program safety by monitoring the program's
behaviour during execution and taking appropriate action before a program violates
some property.Runtime monitoring is in particular important when an exhaustive
formal verification fails. While the approach allows for a safe execution of programs,
it may impose a significant runtime overhead.In this paper, we propose a novel
technique combining verification and monitoring which incurs no overhead during
runtime at all. The technique proceeds by using the inconclusive result of a verification
run as the basis for transforming the program into one where all potential points
of failure are replaced by HALT statements. The new program is safe by construction,
behaviourally equivalent to the original program (except for unsafe behaviour),and
has the same performance characteristics.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Zero Overhead Runtime Monitoring. In:
Proceedings of the 11th International Conference on Software Engineering and
Formal Methods (SEFM). LNCS. ; 2013:244-258. doi:10.1007/978-3-642-40561-7_17'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Zero Overhead Runtime
Monitoring. In Proceedings of the 11th International Conference on Software
Engineering and Formal Methods (SEFM) (pp. 244–258). https://doi.org/10.1007/978-3-642-40561-7_17
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero
Overhead Runtime Monitoring}, DOI={10.1007/978-3-642-40561-7_17},
booktitle={Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Wonisch, Daniel and Schremmer, Alexander and
Wehrheim, Heike}, year={2013}, pages={244–258}, collection={LNCS} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead
Runtime Monitoring.” In Proceedings of the 11th International Conference on
Software Engineering and Formal Methods (SEFM), 244–58. LNCS, 2013. https://doi.org/10.1007/978-3-642-40561-7_17.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,”
in Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM), 2013, pp. 244–258.
mla: Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” Proceedings
of the 11th International Conference on Software Engineering and Formal Methods
(SEFM), 2013, pp. 244–58, doi:10.1007/978-3-642-40561-7_17.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 11th International
Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–258.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-40561-7_17
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:18:41Z
date_updated: 2018-03-16T11:18:41Z
file_id: '1332'
file_name: 469-WSW2013-2.pdf
file_size: 394804
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:18:41Z
has_accepted_license: '1'
language:
- iso: eng
page: 244-258
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 11th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Zero Overhead Runtime Monitoring
type: conference
user_id: '477'
year: '2013'
...
---
_id: '4698'
author:
- first_name: Shirley
full_name: Gregor, Shirley
last_name: Gregor
- first_name: Oliver
full_name: Müller, Oliver
id: '72849'
last_name: Müller
- first_name: Stefan
full_name: Seidel, Stefan
last_name: Seidel
citation:
ama: 'Gregor S, Müller O, Seidel S. Reflection, abstraction and theorizing in design
and development research. In: European Conference on Information Systems.
; 2013.'
apa: Gregor, S., Müller, O., & Seidel, S. (2013). Reflection, abstraction and
theorizing in design and development research. In European Conference on Information
Systems.
bibtex: '@inproceedings{Gregor_Müller_Seidel_2013, title={Reflection, abstraction
and theorizing in design and development research}, booktitle={European Conference
on Information Systems}, author={Gregor, Shirley and Müller, Oliver and Seidel,
Stefan}, year={2013} }'
chicago: Gregor, Shirley, Oliver Müller, and Stefan Seidel. “Reflection, Abstraction
and Theorizing in Design and Development Research.” In European Conference
on Information Systems, 2013.
ieee: S. Gregor, O. Müller, and S. Seidel, “Reflection, abstraction and theorizing
in design and development research,” in European Conference on Information
Systems, 2013.
mla: Gregor, Shirley, et al. “Reflection, Abstraction and Theorizing in Design and
Development Research.” European Conference on Information Systems, 2013.
short: 'S. Gregor, O. Müller, S. Seidel, in: European Conference on Information
Systems, 2013.'
date_created: 2018-10-12T08:30:49Z
date_updated: 2022-01-06T07:01:18Z
extern: '1'
keyword:
- Abstraction
- Affordances
- Design Science Research
- Design Theory
- Information Systems Development
- Reflection
- Theorizing
language:
- iso: eng
main_file_link:
- url: https://aisel.aisnet.org/ecis2013_cr/74/
publication: European Conference on Information Systems
status: public
title: Reflection, abstraction and theorizing in design and development research
type: conference
user_id: '72849'
year: '2013'
...
---
_id: '4699'
author:
- first_name: Jörg
full_name: Becker, Jörg
last_name: Becker
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Ralf
full_name: Knackstedt, Ralf
last_name: Knackstedt
- first_name: Martin
full_name: Matzner, Martin
last_name: Matzner
- first_name: Oliver
full_name: Müller, Oliver
id: '72849'
last_name: Müller
- first_name: Jens
full_name: Pöppelbuss, Jens
last_name: Pöppelbuss
citation:
ama: 'Becker J, Beverungen D, Knackstedt R, Matzner M, Müller O, Pöppelbuss J. Designing
interaction routines in service networks: A modularity and social construction-based
approach. Scandinavian Journal of Information Systems. 2013;(1):17--47.'
apa: 'Becker, J., Beverungen, D., Knackstedt, R., Matzner, M., Müller, O., &
Pöppelbuss, J. (2013). Designing interaction routines in service networks: A modularity
and social construction-based approach. Scandinavian Journal of Information
Systems, (1), 17--47.'
bibtex: '@article{Becker_Beverungen_Knackstedt_Matzner_Müller_Pöppelbuss_2013, title={Designing
interaction routines in service networks: A modularity and social construction-based
approach}, number={1}, journal={Scandinavian Journal of Information Systems},
author={Becker, Jörg and Beverungen, Daniel and Knackstedt, Ralf and Matzner,
Martin and Müller, Oliver and Pöppelbuss, Jens}, year={2013}, pages={17--47} }'
chicago: 'Becker, Jörg, Daniel Beverungen, Ralf Knackstedt, Martin Matzner, Oliver
Müller, and Jens Pöppelbuss. “Designing Interaction Routines in Service Networks:
A Modularity and Social Construction-Based Approach.” Scandinavian Journal
of Information Systems, no. 1 (2013): 17--47.'
ieee: 'J. Becker, D. Beverungen, R. Knackstedt, M. Matzner, O. Müller, and J. Pöppelbuss,
“Designing interaction routines in service networks: A modularity and social construction-based
approach,” Scandinavian Journal of Information Systems, no. 1, pp. 17--47,
2013.'
mla: 'Becker, Jörg, et al. “Designing Interaction Routines in Service Networks:
A Modularity and Social Construction-Based Approach.” Scandinavian Journal
of Information Systems, no. 1, 2013, pp. 17--47.'
short: J. Becker, D. Beverungen, R. Knackstedt, M. Matzner, O. Müller, J. Pöppelbuss,
Scandinavian Journal of Information Systems (2013) 17--47.
date_created: 2018-10-12T08:30:56Z
date_updated: 2022-01-06T07:01:18Z
extern: '1'
issue: '1'
keyword:
- Business process management
- Conceptual modeling
- Interaction routines
- Modular design
- Service networks
- Social construction
language:
- iso: eng
main_file_link:
- url: https://aisel.aisnet.org/sjis/vol25/iss1/2/
page: 17--47
publication: Scandinavian Journal of Information Systems
publication_identifier:
issn:
- '09050167'
status: public
title: 'Designing interaction routines in service networks: A modularity and social
construction-based approach'
type: journal_article
user_id: '72849'
year: '2013'
...
---
_id: '470'
abstract:
- lang: eng
text: In OpenFlow [1], multiple switches share the same control plane which is centralized
atwhat is called the OpenFlow controller. A switch only consists of a forwarding
plane. Rules for forwarding individual packets (called ow entries in OpenFlow)
are pushed from the controller to the switches. In a network with a high arrival
rate of new ows, such as in a data center, the control trac between the switch
and controller can become very high. As a consequence, routing of new ows will
be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard
ow entries can be used to create default routes in the network. However, since
switches do not keep track of ows covered by a wildcard ow entry, the controller
no longer has knowledge about individual ows. To nd out about these individual
ows we propose an extension to the current OpenFlow standard to enable packet
sampling of wildcard ow entries.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet
Sampling to OpenFlow. In: Proceedings of the ACM SIGCOMM ’13. Digital Library.
; 2013:541-542. doi:10.1145/2486001.2491710'
apa: Wette, P., & Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow. In Proceedings of the ACM SIGCOMM
’13 (pp. 541–542). https://doi.org/10.1145/2486001.2491710
bibtex: '@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which
Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow},
DOI={10.1145/2486001.2491710},
booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl,
Holger}, year={2013}, pages={541–542}, collection={Digital Library} }'
chicago: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow.” In Proceedings of the ACM SIGCOMM
’13, 541–42. Digital Library, 2013. https://doi.org/10.1145/2486001.2491710.
ieee: P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding
Packet Sampling to OpenFlow,” in Proceedings of the ACM SIGCOMM ’13, 2013,
pp. 541–542.
mla: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow.” Proceedings of the ACM SIGCOMM ’13,
2013, pp. 541–42, doi:10.1145/2486001.2491710.
short: 'P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1145/2486001.2491710
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:18:01Z
date_updated: 2018-03-16T11:18:01Z
file_id: '1331'
file_name: 470-p541-wette_01.pdf
file_size: 446835
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:18:01Z
has_accepted_license: '1'
page: 541-542
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the ACM SIGCOMM '13
series_title: Digital Library
status: public
title: Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '4700'
author:
- first_name: Jorg
full_name: Becker, Jorg
last_name: Becker
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Ralf
full_name: Knackstedt, Ralf
last_name: Knackstedt
- first_name: Martin
full_name: Matzner, Martin
last_name: Matzner
- first_name: Oliver
full_name: Müller, Oliver
id: '72849'
last_name: Müller
- first_name: Jens
full_name: Pöppelbuss, Jens
last_name: Pöppelbuss
citation:
ama: Becker J, Beverungen D, Knackstedt R, Matzner M, Müller O, Pöppelbuss J. Bridging
the gap between manufacturing and service through IT-based boundary objects. IEEE
Transactions on Engineering Management. 2013;(3):468--482. doi:10.1109/TEM.2012.2214770
apa: Becker, J., Beverungen, D., Knackstedt, R., Matzner, M., Müller, O., &
Pöppelbuss, J. (2013). Bridging the gap between manufacturing and service through
IT-based boundary objects. IEEE Transactions on Engineering Management,
(3), 468--482. https://doi.org/10.1109/TEM.2012.2214770
bibtex: '@article{Becker_Beverungen_Knackstedt_Matzner_Müller_Pöppelbuss_2013, title={Bridging
the gap between manufacturing and service through IT-based boundary objects},
DOI={10.1109/TEM.2012.2214770},
number={3}, journal={IEEE Transactions on Engineering Management}, author={Becker,
Jorg and Beverungen, Daniel and Knackstedt, Ralf and Matzner, Martin and Müller,
Oliver and Pöppelbuss, Jens}, year={2013}, pages={468--482} }'
chicago: 'Becker, Jorg, Daniel Beverungen, Ralf Knackstedt, Martin Matzner, Oliver
Müller, and Jens Pöppelbuss. “Bridging the Gap between Manufacturing and Service
through IT-Based Boundary Objects.” IEEE Transactions on Engineering Management,
no. 3 (2013): 468--482. https://doi.org/10.1109/TEM.2012.2214770.'
ieee: J. Becker, D. Beverungen, R. Knackstedt, M. Matzner, O. Müller, and J. Pöppelbuss,
“Bridging the gap between manufacturing and service through IT-based boundary
objects,” IEEE Transactions on Engineering Management, no. 3, pp. 468--482,
2013.
mla: Becker, Jorg, et al. “Bridging the Gap between Manufacturing and Service through
IT-Based Boundary Objects.” IEEE Transactions on Engineering Management,
no. 3, 2013, pp. 468--482, doi:10.1109/TEM.2012.2214770.
short: J. Becker, D. Beverungen, R. Knackstedt, M. Matzner, O. Müller, J. Pöppelbuss,
IEEE Transactions on Engineering Management (2013) 468--482.
date_created: 2018-10-12T08:31:02Z
date_updated: 2022-01-06T07:01:19Z
doi: 10.1109/TEM.2012.2214770
extern: '1'
issue: '3'
keyword:
- Action research
- boundary spanning
- business process management (BPM)
- service blueprinting
- service networks
language:
- iso: eng
page: 468--482
publication: IEEE Transactions on Engineering Management
publication_identifier:
isbn:
- 0018-9391
issn:
- '00189391'
status: public
title: Bridging the gap between manufacturing and service through IT-based boundary
objects
type: journal_article
user_id: '72849'
year: '2013'
...
---
_id: '471'
author:
- first_name: Alina
full_name: Tezer, Alina
last_name: Tezer
citation:
ama: Tezer A. Verteilte Erstellung und Aktualisierung von Schlüsselservern in
identitätsbasierten Verschlüsselungssystemen. Universität Paderborn; 2013.
apa: Tezer, A. (2013). Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn.
bibtex: '@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn},
author={Tezer, Alina}, year={2013} }'
chicago: Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
ieee: A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
mla: Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
short: A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in
identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten
Verschlüsselungssystemen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '472'
author:
- first_name: Marco
full_name: Engelbrecht, Marco
last_name: Engelbrecht
citation:
ama: Engelbrecht M. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn; 2013.
apa: Engelbrecht, M. (2013). Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn.
bibtex: '@book{Engelbrecht_2013, title={Vergleichsstudie zur Ausdrucksstärke von
SMT-Solvern}, publisher={Universität Paderborn}, author={Engelbrecht, Marco},
year={2013} }'
chicago: Engelbrecht, Marco. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
ieee: M. Engelbrecht, Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
mla: Engelbrecht, Marco. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
short: M. Engelbrecht, Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:19Z
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: Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '473'
abstract:
- lang: eng
text: We present a solution to the problem of privacy invasion in a multiparty digital
rights management scheme. (Roaming) users buy content licenses from a content
provider and execute it at any nearby content distributor. Our approach, which
does not need any trusted third party - in contrast to most related work on privacy-preserving
DRM - is based on a re-encryption scheme that runs on any mobile Android device.
Only a minor security-critical part needs to be performed on the device's smartcard
which could, for instance, be a SIM card.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Stephan
full_name: Sekula, Stephan
last_name: Sekula
citation:
ama: 'Petrlic R, Sekula S. Unlinkable content playbacks in a multiparty DRM system.
In: Wang L, Shafiq B, eds. Data and Applications Security and Privacy XXVII.
Lecture Notes in Computer Science. ; 2013:289-296. doi:10.1007/978-3-642-39256-6_21'
apa: Petrlic, R., & Sekula, S. (2013). Unlinkable content playbacks in a multiparty
DRM system. In L. Wang & B. Shafiq (Eds.), Data and Applications Security
and Privacy XXVII (pp. 289–296). https://doi.org/10.1007/978-3-642-39256-6_21
bibtex: '@inproceedings{Petrlic_Sekula_2013, series={Lecture Notes in Computer Science},
title={Unlinkable content playbacks in a multiparty DRM system}, DOI={10.1007/978-3-642-39256-6_21},
booktitle={Data and Applications Security and Privacy XXVII}, author={Petrlic,
Ronald and Sekula, Stephan}, editor={Wang, Lingyu and Shafiq, BasitEditors}, year={2013},
pages={289–296}, collection={Lecture Notes in Computer Science} }'
chicago: Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a
Multiparty DRM System.” In Data and Applications Security and Privacy XXVII,
edited by Lingyu Wang and Basit Shafiq, 289–96. Lecture Notes in Computer Science,
2013. https://doi.org/10.1007/978-3-642-39256-6_21.
ieee: R. Petrlic and S. Sekula, “Unlinkable content playbacks in a multiparty DRM
system,” in Data and Applications Security and Privacy XXVII, 2013, pp.
289–296.
mla: Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a Multiparty
DRM System.” Data and Applications Security and Privacy XXVII, edited by
Lingyu Wang and Basit Shafiq, 2013, pp. 289–96, doi:10.1007/978-3-642-39256-6_21.
short: 'R. Petrlic, S. Sekula, in: L. Wang, B. Shafiq (Eds.), Data and Applications
Security and Privacy XXVII, 2013, pp. 289–296.'
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:19Z
ddc:
- '040'
doi: 10.1007/978-3-642-39256-6_21
editor:
- first_name: Lingyu
full_name: Wang, Lingyu
last_name: Wang
- first_name: Basit
full_name: Shafiq, Basit
last_name: Shafiq
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:17:30Z
date_updated: 2018-03-16T11:17:30Z
file_id: '1330'
file_name: 473-drm-general-1-camera-ready.pdf
file_size: 286049
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:17:30Z
has_accepted_license: '1'
page: 289-296
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Data and Applications Security and Privacy XXVII
series_title: Lecture Notes in Computer Science
status: public
title: Unlinkable content playbacks in a multiparty DRM system
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '474'
abstract:
- lang: eng
text: Suppose some individuals are allowed to engage in different groups at the
same time and they generate a certain welfare by cooperation. Finding appropriate
ways for distributing this welfare is a non-trivial issue. The purpose of this
work is to analyze two-stage allocation procedures where first each group receives
a share of the welfare which is then, subsequently, distributed among the corresponding
members. To study these procedures in a structured way, cooperative games and
network games are combined in a general framework by using mathematical hypergraphs.
Moreover, several convincing requirements on allocation procedures are discussed
and formalized. Thereby it will be shown, for example, that the Position Value
and iteratively applying the Myerson Value can be characterized by similar axiomatizations.
author:
- first_name: Nils
full_name: Röhl, Nils
last_name: Röhl
citation:
ama: Röhl N. Two-Stage Allocation Procedures. Universität Paderborn; 2013.
apa: Röhl, N. (2013). Two-Stage Allocation Procedures. Universität Paderborn.
bibtex: '@book{Röhl_2013, title={Two-Stage Allocation Procedures}, publisher={Universität
Paderborn}, author={Röhl, Nils}, year={2013} }'
chicago: Röhl, Nils. Two-Stage Allocation Procedures. Universität Paderborn,
2013.
ieee: N. Röhl, Two-Stage Allocation Procedures. Universität Paderborn, 2013.
mla: Röhl, Nils. Two-Stage Allocation Procedures. Universität Paderborn,
2013.
short: N. Röhl, Two-Stage Allocation Procedures, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:20Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:16:59Z
date_updated: 2018-03-16T11:16:59Z
file_id: '1329'
file_name: 474-WP73.pdf
file_size: 424301
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:16:59Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Two-Stage Allocation Procedures
type: report
user_id: '477'
year: '2013'
...
---
_id: '475'
abstract:
- lang: eng
text: We propose a privacy-preserving digital rights management scheme for (future)
cloud computing. Users buy software from software providers and execute it at
computing centers. Our solution allows software providers to provide different
license models, like execute at most n-times models. Users’ anonymity and unlinkability
of actions are preserved and thus, profile building is not even possible under
(a) pseudonym. Privacy protection in the honest-but-curious model is achieved
by combining ring signatures with an anonymous recipient scheme.We employ secret
sharing in a unique manner that allows the software provider to expose the user’s
identity if the user commits fraud, e.g. by exceeding the execution limit n.
author:
- first_name: Nakul
full_name: Joshi, Nakul
last_name: Joshi
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: 'Joshi N, Petrlic R. Towards practical privacy-preserving Digital Rights Management
for Cloud Computing. In: Proceedings of the 10th Annual IEEE Consumer Communications
& Networking Conference (CCNC). ; 2013:259-264. doi:10.1109/CCNC.2013.6488456'
apa: Joshi, N., & Petrlic, R. (2013). Towards practical privacy-preserving Digital
Rights Management for Cloud Computing. In Proceedings of the 10th Annual IEEE
Consumer Communications & Networking Conference (CCNC) (pp. 259–264).
https://doi.org/10.1109/CCNC.2013.6488456
bibtex: '@inproceedings{Joshi_Petrlic_2013, title={Towards practical privacy-preserving
Digital Rights Management for Cloud Computing}, DOI={10.1109/CCNC.2013.6488456},
booktitle={Proceedings of the 10th Annual IEEE Consumer Communications & Networking
Conference (CCNC)}, author={Joshi, Nakul and Petrlic, Ronald}, year={2013}, pages={259–264}
}'
chicago: Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving
Digital Rights Management for Cloud Computing.” In Proceedings of the 10th
Annual IEEE Consumer Communications & Networking Conference (CCNC), 259–64,
2013. https://doi.org/10.1109/CCNC.2013.6488456.
ieee: N. Joshi and R. Petrlic, “Towards practical privacy-preserving Digital Rights
Management for Cloud Computing,” in Proceedings of the 10th Annual IEEE Consumer
Communications & Networking Conference (CCNC), 2013, pp. 259–264.
mla: Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving Digital
Rights Management for Cloud Computing.” Proceedings of the 10th Annual IEEE
Consumer Communications & Networking Conference (CCNC), 2013, pp. 259–64,
doi:10.1109/CCNC.2013.6488456.
short: 'N. Joshi, R. Petrlic, in: Proceedings of the 10th Annual IEEE Consumer Communications
& Networking Conference (CCNC), 2013, pp. 259–264.'
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
doi: 10.1109/CCNC.2013.6488456
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:16:29Z
date_updated: 2018-03-16T11:16:29Z
file_id: '1328'
file_name: 475-privacy-drm-cloud-5.pdf
file_size: 370473
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:16:29Z
has_accepted_license: '1'
page: 259-264
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 10th Annual IEEE Consumer Communications & Networking
Conference (CCNC)
status: public
title: Towards practical privacy-preserving Digital Rights Management for Cloud Computing
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '476'
abstract:
- lang: eng
text: 'An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint
paths between a source and a sink, each path carrying a unit of ow, and an h-route
ow is a non-negative linear combination of elementary h-routeows. An h-route cut
is a set of edges whose removal decreases the maximum h-route ow between a given
source-sink pair (or between every source-sink pair in the multicommodity setting)
to zero. The main result of this paper is an approximate duality theorem for multicommodity
h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h
and at most O(log4 k f) where f is the size of the maximum h-routeow and k is
the number of commodities. The main step towards the proof of this duality is
the design and analysis of a polynomial-time approximation algorithm for the minimum
h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously,
polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient
of our algorithm is a novel rounding technique that we call multilevel ball-growing.
Though the proof of the duality relies on this algorithm, it is not a straightforward
corollary of it as in the case of classical multicommodity ows and cuts. Similar
results are shown also for the sparsest multiroute cut problem.'
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. Towards Duality of Multicommodity Multiroute Cuts
and Flows: Multilevel Ball-Growing. Theory of Computing Systems. 2013;(2):341-363.
doi:10.1007/s00224-013-9454-3'
apa: 'Kolman, P., & Scheideler, C. (2013). Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems,
(2), 341–363. https://doi.org/10.1007/s00224-013-9454-3'
bibtex: '@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.1007/s00224-013-9454-3},
number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman,
Petr and Scheideler, Christian}, year={2013}, pages={341–363} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2 (2013): 341–63. https://doi.org/10.1007/s00224-013-9454-3.'
ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute
Cuts and Flows: Multilevel Ball-Growing,” Theory of Computing Systems,
no. 2, pp. 341–363, 2013.'
mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.'
short: P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9454-3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:07:18Z
date_updated: 2018-03-15T14:07:18Z
file_id: '1326'
file_name: 476-tocsrevised3b.pdf
file_size: 264308
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:07:18Z
has_accepted_license: '1'
issue: '2'
page: 341-363
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing'
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '477'
abstract:
- lang: eng
text: We consider the k-token dissemination problem, where k initially arbitrarily
distributed tokens have to be disseminated to all nodes in a dynamic network (as
introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks,
our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean
plane and two nodes are connected if and only if their distance is at most R.
Our worst-case adversary is allowed to move the nodes on the plane, but the maximum
velocity v_max of each node is limited and the graph must be connected in each
round. For this model, we provide almost tight lower and upper bounds for k-token
dissemination if nodes are restricted to send only one token per round. It turns
out that the maximum velocity v_max is a meaningful parameter to characterize
dynamics in our model.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F.
Token Dissemination in Geometric Dynamic Networks. In: Algorithms for Sensor
Systems - 9th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia
Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes
in Computer Science. ; 2013:22-34. doi:10.1007/978-3-642-45346-5_3'
apa: Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf
der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
(pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
bibtex: '@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013,
series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric
Dynamic Networks}, DOI={10.1007/978-3-642-45346-5_3},
booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34},
collection={Lecture Notes in Computer Science} }'
chicago: Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali,
and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.”
In Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 22–34. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-45346-5_3.
ieee: S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der
Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013,
Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013,
pp. 22–34.
mla: Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers,
2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
short: 'S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der
Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 2013, pp. 22–34.'
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:38Z
date_updated: 2018-03-15T14:06:38Z
file_id: '1325'
file_name: 477-geometric-dynamic-networks_01.pdf
file_size: 193169
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:38Z
has_accepted_license: '1'
page: 22-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers
series_title: Lecture Notes in Computer Science
status: public
title: Token Dissemination in Geometric Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Software systems are playing an increasing role in our everyday life, and
as the amount of software applications grows, so does their complexity and the
relevance of their computations. Software components can be found in many systems
that are charged with safety-critical tasks, such as control systems for aviation
or power plants. Hence, software verification techniques that are capable of proving
the absence of critical errors are becoming more and more important in the field
software engineering. A well-established approach to software verification is
model checking. Applying this technique involves an exhaustive exploration of
a state space model corresponding to the system under consideration. The major
challenge in model checking is the so-called state explosion problem: The state
space of a software system grows exponentially with its size. Thus, the straightforward
modelling of real-life systems practically impossible. A common approach to this
problem is the application of abstraction techniques, which reduce the original
state space by mapping it on a significantly smaller abstract one. Abstraction
inherently involves a loss of information, and thus, the resulting abstract model
may be too imprecise for a definite result in verification. Therefore, abstraction
is typically combined with abstraction refinement: An initially very coarse abstract
model is iteratively refined, i.e. enriched with new details about the original
system, until a level of abstraction is reached that is precise enough for a definite
outcome. Abstraction refinement-based model checking is fully automatable and
it is considered as one of the most promising approaches to the state explosion
problem in verification. However, it is still faced with a number of challenges.
There exist several types of abstraction techniques and not every type is equally
well-suited for all kinds of systems and verification tasks. Moreover, the selection
of adequate refinement steps is nontrivial and typically the most crucial part
of the overall approach: Unfavourable refinement decisions can compromise the
state space-reducing effect of abstraction, and as a consequence, can easily lead
to the failure of verification. It is, however, hard to predict which refinement
steps will eventually be expedient for verification – and which not.'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
citation:
ama: Timm N. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn; 2013.
apa: Timm, N. (2013). Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn.
bibtex: '@book{Timm_2013, title={Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems}, publisher={Universität Paderborn}, author={Timm,
Nils}, year={2013} }'
chicago: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn, 2013.
ieee: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn, 2013.
mla: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for
Verifying Concurrent Systems. Universität Paderborn, 2013.
short: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:05Z
date_updated: 2018-03-15T14:06:05Z
file_id: '1324'
file_name: 478-Dissertation-Timm.pdf
file_size: 931458
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:05Z
has_accepted_license: '1'
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent
Systems
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '480'
abstract:
- lang: eng
text: Although of considerable practical importance, the separate impact of individual
and collective reputation on firm performance (e.g. product prices) has not yet
been convincingly demonstrated. We use a sample of some 70 different wineries
offering more than 1,300 different Riesling wines from the Mosel valley to isolate
the returns to individual reputation (measured by expert ratings in a highly respected
wine guide) from the returns to collective reputation (measured by membership
in two different professional associations where members are assumed to monitor
each other very closely). We find that both effects are statistically significant
and economically relevant with the latter being more important in quantitative
terms than the former.
author:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
- first_name: Robert
full_name: Simmons, Robert
last_name: Simmons
citation:
ama: 'Frick B, Simmons R. The Impact of Individual and Collective Reputation on
Wine Prices: Empirical Evidence from the Mosel Valley. Journal of Business
Economics. 2013;83(2):101-119. doi:10.1007/s11573-013-0652-x'
apa: 'Frick, B., & Simmons, R. (2013). The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley. Journal
of Business Economics, 83(2), 101–119. https://doi.org/10.1007/s11573-013-0652-x'
bibtex: '@article{Frick_Simmons_2013, title={The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley}, volume={83},
DOI={10.1007/s11573-013-0652-x},
number={2}, journal={Journal of Business Economics}, publisher={Springer}, author={Frick,
Bernd and Simmons, Robert}, year={2013}, pages={101–119} }'
chicago: 'Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.” Journal
of Business Economics 83, no. 2 (2013): 101–19. https://doi.org/10.1007/s11573-013-0652-x.'
ieee: 'B. Frick and R. Simmons, “The Impact of Individual and Collective Reputation
on Wine Prices: Empirical Evidence from the Mosel Valley,” Journal of Business
Economics, vol. 83, no. 2, pp. 101–119, 2013.'
mla: 'Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.” Journal
of Business Economics, vol. 83, no. 2, Springer, 2013, pp. 101–19, doi:10.1007/s11573-013-0652-x.'
short: B. Frick, R. Simmons, Journal of Business Economics 83 (2013) 101–119.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:24Z
ddc:
- '040'
department:
- _id: '183'
doi: 10.1007/s11573-013-0652-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:02:36Z
date_updated: 2018-03-15T14:02:36Z
file_id: '1322'
file_name: 480-Frick.pdf
file_size: 371437
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:02:36Z
has_accepted_license: '1'
intvolume: ' 83'
issue: '2'
language:
- iso: eng
page: 101-119
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Journal of Business Economics
publisher: Springer
status: public
title: 'The Impact of Individual and Collective Reputation on Wine Prices: Empirical
Evidence from the Mosel Valley'
type: journal_article
user_id: '477'
volume: 83
year: '2013'
...
---
_id: '481'
abstract:
- lang: eng
text: Cloud computing offers high availability, dynamic scalability, and elasticity
requiring only very little administration. However, this service comes with financial
costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot
match the quality of service of the cloud. This paper focuses on the case study
of Wikipedia and presents an approach to reduce the operational costs of hosting
similar websites in the cloud by using a practical peer-to-peer approach. The
visitors of the site are joining a Chord overlay, which acts as first cache for
article lookups. Simulation results show, that up to 72% of the article lookups
in Wikipedia could be answered by other visitors instead of using the cloud.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Lars
full_name: Bremer, Lars
last_name: Bremer
citation:
ama: 'Graffi K, Bremer L. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia
Case. In: Proceedings of the International Conference on Communications (ICC’13).
; 2013:3444-3449. doi:10.1109/ICC.2013.6655082'
apa: 'Graffi, K., & Bremer, L. (2013). Symbiotic Coupling of P2P and Cloud Systems:
The Wikipedia Case. In Proceedings of the International Conference on Communications
(ICC’13) (pp. 3444–3449). https://doi.org/10.1109/ICC.2013.6655082'
bibtex: '@inproceedings{Graffi_Bremer_2013, title={Symbiotic Coupling of P2P and
Cloud Systems: The Wikipedia Case}, DOI={10.1109/ICC.2013.6655082},
booktitle={Proceedings of the International Conference on Communications (ICC’13)},
author={Graffi, Kalman and Bremer, Lars}, year={2013}, pages={3444–3449} }'
chicago: 'Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud
Systems: The Wikipedia Case.” In Proceedings of the International Conference
on Communications (ICC’13), 3444–49, 2013. https://doi.org/10.1109/ICC.2013.6655082.'
ieee: 'K. Graffi and L. Bremer, “Symbiotic Coupling of P2P and Cloud Systems: The
Wikipedia Case,” in Proceedings of the International Conference on Communications
(ICC’13), 2013, pp. 3444–3449.'
mla: 'Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems:
The Wikipedia Case.” Proceedings of the International Conference on Communications
(ICC’13), 2013, pp. 3444–49, doi:10.1109/ICC.2013.6655082.'
short: 'K. Graffi, L. Bremer, in: Proceedings of the International Conference on
Communications (ICC’13), 2013, pp. 3444–3449.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/ICC.2013.6655082
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:02:01Z
date_updated: 2018-03-15T14:02:01Z
file_id: '1321'
file_name: 481-Symbiotic.Coupling.of.P2P.and.Cloud.Systems.The.Wikipedia.Case2.pdf
file_size: 1405789
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:02:01Z
has_accepted_license: '1'
language:
- iso: eng
page: '3444 - 3449 '
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 International Conference on Communications (ICC'13)
status: public
title: 'Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case'
type: conference
user_id: '477'
year: '2013'
...
---
_id: '482'
author:
- first_name: Maarten
full_name: Bieshaar, Maarten
last_name: Bieshaar
citation:
ama: Bieshaar M. Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen. Universität Paderborn; 2013.
apa: Bieshaar, M. (2013). Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn.
bibtex: '@book{Bieshaar_2013, title={Statistisches Planen von Aktionen für autonome
mobile Roboter in realen Umgebungen}, publisher={Universität Paderborn}, author={Bieshaar,
Maarten}, year={2013} }'
chicago: Bieshaar, Maarten. Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn, 2013.
ieee: M. Bieshaar, Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen. Universität Paderborn, 2013.
mla: Bieshaar, Maarten. Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn, 2013.
short: M. Bieshaar, Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Statistisches Planen von Aktionen für autonome mobile Roboter in realen Umgebungen
type: bachelorsthesis
user_id: '477'
year: '2013'
...