---
_id: '654'
abstract:
- lang: eng
text: Research on peer-to-peer (p2p) and distributed systems needs evaluation tools
to predict and observe the behavior of protocols and mechanisms in large scale
networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems
aiming at the evaluation of interdependencies in multi-layered p2p systems. The
simulator is written in Java, is event-based and mainly used in p2p research projects.
The main development of PeerfactSim.KOM started in 2005 and is driven since 2006
by the project “QuaP2P”,which aims at the systematic improvement and benchmarking
of p2p systems. Further users of the simulator are working in the project “On-the-fly
Computing” aiming at researching p2p-based service oriented architectures. Both
projects state severe requirements on the evaluation of multi-layered and large-scale
distributed systems. We describe the architecture of PeerfactSim.KOM supporting
these requirements in Section II, present the workflow, selected experiences and
lessons learned in Section III and conclude the overview in Section IV.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons
Learned. In: Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP). ; 2011:154-155. doi:10.1109/P2P.2011.6038673'
apa: 'Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and
Lessons Learned. In Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP) (pp. 154–155). https://doi.org/10.1109/P2P.2011.6038673'
bibtex: '@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator
- Experiences and Lessons Learned}, DOI={10.1109/P2P.2011.6038673},
booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing
(IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }'
chicago: 'Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences
and Lessons Learned.” In Proceedings of the IEEE International Conference on
Peer-to-Peer Computing (IEEE PsP), 154–55, 2011. https://doi.org/10.1109/P2P.2011.6038673.'
ieee: 'K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons
Learned,” in Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–155.'
mla: 'Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and
Lessons Learned.” Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–55, doi:10.1109/P2P.2011.6038673.'
short: 'K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–155.'
date_created: 2017-10-17T12:42:59Z
date_updated: 2022-01-06T07:03:11Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/P2P.2011.6038673
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:50:18Z
date_updated: 2018-03-14T13:50:18Z
file_id: '1221'
file_name: 654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf
file_size: 327680
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:50:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 154-155
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 IEEE International Conference on Peer-to-Peer Computing
(IEEE PsP)
status: public
title: 'PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned'
type: conference
user_id: '477'
year: '2011'
...
---
_id: '657'
abstract:
- lang: eng
text: 'We present two distributed, constant factor approximation algorithms for
the metric facility location problem. Both algorithms have been designed with
a strong emphasis on applicability in the area of wireless sensor networks: in
order to execute them, each sensor node only requires limited local knowledge
and simple computations. Also, the algorithms can cope with measurement errors
and take into account that communication costs between sensor nodes do not necessarily
increase linearly with the distance, but can be represented by a polynomial. Since
it cannot always be expected that sensor nodes execute algorithms in a synchronized
way, our algorithms are executed in an asynchronous model (but they are still
able to break symmetry that might occur when two neighboring nodes act at exactly
the same time). Furthermore, they can deal with dynamic scenarios: if a node moves,
the solution is updated and the update affects only nodes in the local neighborhood.
Finally, the algorithms are robust in the sense that incorrect behavior of some
nodes during some round will, in the end, still result in a good approximation.
The first algorithm runs in expected O(log_{1+\epsilon} n) communication rounds
and yields a \my^4(1+4\my^2(1+\epsilon)^{1/p})^p approximation, while the second
has a running time of expected O(log^2_{1+\epsilon} n) communication rounds and
an approximation factor of \my^4(1 + 2(1 + \epsilon)^{1/p})^p. Here, \epsilon
> 0 is an arbitrarily small constant, p the exponent of the polynomial representing
the communication costs, and \my the relative measurement error.'
author:
- first_name: Sebastan
full_name: Abshoff, Sebastan
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: 'Barbara '
full_name: 'Kempkes, Barbara '
last_name: Kempkes
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: 'Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation
Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware
Sensor Networks. In: Proceedings of the 7th International Symposium on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS).
LNCS. ; 2011:13-27. doi:10.1007/978-3-642-28209-6_3'
apa: Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., & Pietrzyk, P.
(2011). Local Approximation Algorithms for the Uncapacitated Metric Facility Location
Problem in Power-Aware Sensor Networks. In Proceedings of the 7th International
Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous
Mobile Entities (ALGOSENSORS) (pp. 13–27). https://doi.org/10.1007/978-3-642-28209-6_3
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Degener_Kempkes_Pietrzyk_2011, series={LNCS},
title={Local Approximation Algorithms for the Uncapacitated Metric Facility Location
Problem in Power-Aware Sensor Networks}, DOI={10.1007/978-3-642-28209-6_3},
booktitle={Proceedings of the 7th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)},
author={Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and
Kempkes, Barbara and Pietrzyk, Peter}, year={2011}, pages={13–27}, collection={LNCS}
}'
chicago: Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara Kempkes,
and Peter Pietrzyk. “Local Approximation Algorithms for the Uncapacitated Metric
Facility Location Problem in Power-Aware Sensor Networks.” In Proceedings of
the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad
Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 13–27. LNCS, 2011.
https://doi.org/10.1007/978-3-642-28209-6_3.
ieee: S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local
Approximation Algorithms for the Uncapacitated Metric Facility Location Problem
in Power-Aware Sensor Networks,” in Proceedings of the 7th International Symposium
on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile
Entities (ALGOSENSORS), 2011, pp. 13–27.
mla: Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated
Metric Facility Location Problem in Power-Aware Sensor Networks.” Proceedings
of the 7th International Symposium on Algorithms for Sensor Systems, Wireless
Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27,
doi:10.1007/978-3-642-28209-6_3.
short: 'S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, P. Pietrzyk, in: Proceedings
of the 7th International Symposium on Algorithms for Sensor Systems, Wireless
Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.'
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:12Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-28209-6_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:48:21Z
date_updated: 2018-03-14T13:48:21Z
file_id: '1219'
file_name: 657-flp_algosensors2011-Cord-Landwehr.pdf
file_size: 454740
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:48:21Z
has_accepted_license: '1'
language:
- iso: eng
page: 13-27
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 7th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)
series_title: LNCS
status: public
title: Local Approximation Algorithms for the Uncapacitated Metric Facility Location
Problem in Power-Aware Sensor Networks
type: conference
user_id: '477'
year: '2011'
...
---
_id: '660'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
citation:
ama: Peuster M. Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments. Universität Paderborn; 2011.
apa: Peuster, M. (2011). Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn.
bibtex: '@book{Peuster_2011, title={Defining and Deploying Complex Applicances in
Multi-Site Cloud Environments}, publisher={Universität Paderborn}, author={Peuster,
Manuel}, year={2011} }'
chicago: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn, 2011.
ieee: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments. Universität Paderborn, 2011.
mla: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site
Cloud Environments. Universität Paderborn, 2011.
short: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud
Environments, Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Defining and Deploying Complex Applicances in Multi-Site Cloud Environments
type: bachelorsthesis
user_id: '15504'
year: '2011'
...
---
_id: '662'
abstract:
- lang: eng
text: We present Corona, a deterministic self-stabilizing algorithm for skip list
construction in structured overlay networks. Corona operates in the low-atomicity
message-passing asynchronous system model. Corona requires constant process memory
space for its operation and, therefore, scales well. We prove the general necessary
conditions limiting the initial states from which a self-stabilizing structured
overlay network in message-passing system can be constructed. The conditions require
that initial state information has to form a weakly connected graph and it should
only contain identiers that are present in the system. We formally describe Corona
and rigorously prove that it stabilizes from an arbitrary initial state subject
to the necessary conditions. We extend Corona to construct a skip graph.
author:
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Rizal
full_name: Mohd, Rizal
last_name: Mohd
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing
Skip List. In: Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370.
doi:10.1007/978-3-642-24550-3_27'
apa: 'Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing
Deterministic Message-Passing Skip List. In Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27'
bibtex: '@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona:
A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd,
Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS}
}'
chicago: 'Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A
Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the
13th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.'
ieee: 'M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic
Message-Passing Skip List,” in Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011,
pp. 356--370.'
mla: 'Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing
Skip List.” Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.'
short: 'M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2011, pp. 356--370.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_27
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:46:48Z
date_updated: 2018-03-14T13:46:48Z
file_id: '1217'
file_name: 662-SSS2011-Corona-Scheideler.pdf
file_size: 305543
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:46:48Z
has_accepted_license: '1'
page: 356--370
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 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: 'Corona: A Stabilizing Deterministic Message-Passing Skip List'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '663'
author:
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
citation:
ama: Swierkot K. Complexity Classes for Local Computation. Universität Paderborn;
2011.
apa: Swierkot, K. (2011). Complexity Classes for Local Computation. Universität
Paderborn.
bibtex: '@book{Swierkot_2011, title={Complexity Classes for Local Computation},
publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }'
chicago: Swierkot, Kamil. Complexity Classes for Local Computation. Universität
Paderborn, 2011.
ieee: K. Swierkot, Complexity Classes for Local Computation. Universität
Paderborn, 2011.
mla: Swierkot, Kamil. Complexity Classes for Local Computation. Universität
Paderborn, 2011.
short: K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn,
2011.
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '63'
language:
- iso: eng
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
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Complexity Classes for Local Computation
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '665'
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
citation:
ama: Wette P. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn; 2011.
apa: Wette, P. (2011). Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn.
bibtex: '@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip},
year={2011} }'
chicago: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
ieee: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
mla: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
short: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord, Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:14Z
department:
- _id: '79'
language:
- iso: ger
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
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel
von Chord
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '667'
citation:
ama: Meyer auf der Heide F, Rajaraman R, eds. 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures.; 2011. doi:10.1145/1989493
apa: Meyer auf der Heide, F., & Rajaraman, R. (Eds.). (2011). 23rd Annual
ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/1989493
bibtex: '@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures}, DOI={10.1145/1989493},
year={2011} }'
chicago: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, eds. 23rd Annual
ACM Symposium on Parallelism in Algorithms and Architectures, 2011. https://doi.org/10.1145/1989493.
ieee: F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures. 2011.
mla: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual
ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493.
short: F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on
Parallelism in Algorithms and Architectures, 2011.
date_created: 2017-10-17T12:43:02Z
date_updated: 2022-01-06T07:03:14Z
department:
- _id: '63'
doi: 10.1145/1989493
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: 'Rajmohan '
full_name: 'Rajaraman, Rajmohan '
last_name: Rajaraman
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
status: public
title: 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures
type: conference_editor
user_id: '477'
year: '2011'
...
---
_id: '668'
abstract:
- lang: eng
text: The objective of this study is the analysis of movie success mechanisms in
a genre-specific context. Instead of the examination of all time box office champions,
we focus on the two film genres of computer animated and comic book based films.
By introducing the concept of the motion-picture marketing mix, which represents
a set of tactical marketing tools in order to strengthen a company’s strategic
customer orientation, we are able to systematically identify key movie success
factors. We conduct a cross-sectional empirical analysis across regional distinctions
based on dataset that covers a time horizon of more than 30 years. We find empirical
evidence that actors with ex ante popularity, award nominations and the production
budget represent key movie success mechanisms and significantly influence a movie’s
commercial appeal. Additionally, word-of-mouth creates reputation effects that
also significantly affects box office gross.
author:
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
citation:
ama: Kaimann D. “To Infinity and beyond!” - A Genre-Specific Film Analysis of
Movie Success Mechanisms. Universität Paderborn; 2011.
apa: Kaimann, D. (2011). “To infinity and beyond!” - A genre-specific film analysis
of movie success mechanisms. Universität Paderborn.
bibtex: '@book{Kaimann_2011, title={“To infinity and beyond!” - A genre-specific
film analysis of movie success mechanisms}, publisher={Universität Paderborn},
author={Kaimann, Daniel}, year={2011} }'
chicago: Kaimann, Daniel. “To Infinity and beyond!” - A Genre-Specific Film Analysis
of Movie Success Mechanisms. Universität Paderborn, 2011.
ieee: D. Kaimann, “To infinity and beyond!” - A genre-specific film analysis
of movie success mechanisms. Universität Paderborn, 2011.
mla: Kaimann, Daniel. “To Infinity and beyond!” - A Genre-Specific Film Analysis
of Movie Success Mechanisms. Universität Paderborn, 2011.
short: D. Kaimann, “To Infinity and beyond!” - A Genre-Specific Film Analysis of
Movie Success Mechanisms, Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:02Z
date_updated: 2022-01-06T07:03:15Z
ddc:
- '040'
department:
- _id: '183'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:30:32Z
date_updated: 2018-03-14T13:30:32Z
file_id: '1213'
file_name: 668-SSRN-id2076540.pdf
file_size: 800960
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:30:32Z
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: '"To infinity and beyond!" - A genre-specific film analysis of movie success
mechanisms'
type: report
user_id: '477'
year: '2011'
...