---
_id: '269'
abstract:
- lang: eng
text: Proof-carrying hardware is an approach that has recently been proposed for
the efficient verification of reconfigurable modules. We present an application
of proof-carrying hardware to guarantee the correct functionality of dynamically
reconfigured image processing modules. Our prototype comprises a reconfigurable-system-on-chip
with an embedded virtual FPGA fabric. This setup allows us to leverage open source
FPGA synthesis and backend tools to produce FPGA configuration bitstreams with
an open format and, thus, to demonstrate and experimentally evaluate proof-carrying
hardware at the bitstream level.
author:
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Sen
full_name: Wu, Sen
last_name: Wu
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Wiersema T, Wu S, Platzner M. On-The-Fly Verification of Reconfigurable Image
Processing Modules based on a Proof-Carrying Hardware Approach. In: Proceedings
of the International Symposium in Reconfigurable Computing (ARC). LNCS. ;
2015:365--372. doi:10.1007/978-3-319-16214-0_32'
apa: Wiersema, T., Wu, S., & Platzner, M. (2015). On-The-Fly Verification of
Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach.
In Proceedings of the International Symposium in Reconfigurable Computing (ARC)
(pp. 365--372). https://doi.org/10.1007/978-3-319-16214-0_32
bibtex: '@inproceedings{Wiersema_Wu_Platzner_2015, series={LNCS}, title={On-The-Fly
Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying
Hardware Approach}, DOI={10.1007/978-3-319-16214-0_32},
booktitle={Proceedings of the International Symposium in Reconfigurable Computing
(ARC)}, author={Wiersema, Tobias and Wu, Sen and Platzner, Marco}, year={2015},
pages={365--372}, collection={LNCS} }'
chicago: Wiersema, Tobias, Sen Wu, and Marco Platzner. “On-The-Fly Verification
of Reconfigurable Image Processing Modules Based on a Proof-Carrying Hardware
Approach.” In Proceedings of the International Symposium in Reconfigurable
Computing (ARC), 365--372. LNCS, 2015. https://doi.org/10.1007/978-3-319-16214-0_32.
ieee: T. Wiersema, S. Wu, and M. Platzner, “On-The-Fly Verification of Reconfigurable
Image Processing Modules based on a Proof-Carrying Hardware Approach,” in Proceedings
of the International Symposium in Reconfigurable Computing (ARC), 2015, pp.
365--372.
mla: Wiersema, Tobias, et al. “On-The-Fly Verification of Reconfigurable Image Processing
Modules Based on a Proof-Carrying Hardware Approach.” Proceedings of the International
Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372, doi:10.1007/978-3-319-16214-0_32.
short: 'T. Wiersema, S. Wu, M. Platzner, in: Proceedings of the International Symposium
in Reconfigurable Computing (ARC), 2015, pp. 365--372.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:30Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1007/978-3-319-16214-0_32
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:32:42Z
date_updated: 2018-03-21T09:32:42Z
file_id: '1477'
file_name: 269-paper_53.pdf
file_size: 344309
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:32:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 365--372
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 International Symposium in Reconfigurable Computing
(ARC)
series_title: LNCS
status: public
title: On-The-Fly Verification of Reconfigurable Image Processing Modules based on
a Proof-Carrying Hardware Approach
type: conference
user_id: '477'
year: '2015'
...
---
_id: '320'
abstract:
- lang: eng
text: 'We consider structural and algorithmic questions related to the Nash dynamics
of weighted congestion games. In weighted congestion games with linear latency
functions, the existence of pure Nash equilibria is guaranteed by a potential
function argument. Unfortunately, this proof of existence is inefficient and computing
pure Nash equilibria in such games is a PLS-hard problem even when all players
have unit weights. The situation gets worse when superlinear (e.g., quadratic)
latency functions come into play; in this case, the Nash dynamics of the game
may contain cycles and pure Nash equilibria may not even exist. Given these obstacles,
we consider approximate pure Nash equilibria as alternative solution concepts.
A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game
from which no player has any incentive to deviate in order to improve her cost
by a multiplicative factor higher than ρ. Do such equilibria exist for small values
of ρ? And if so, can we compute them efficiently?We provide positive answers to
both questions for weighted congestion games with polynomial latency functions
by exploiting an “approximation” of such games by a new class of potential games
that we call Ψ-games. This allows us to show that these games have d!-approximate
pure Nash equilibria, where d is the maximum degree of the latency functions.
Our main technical contribution is an efficient algorithm for computing O(1)-approximate
pure Nash equilibria when d is a constant. For games with linear latency functions,
the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency
functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial
in the number of bits in the representation of the game and 1/γ. As a byproduct
of our techniques, we also show the following interesting structural statement
for weighted congestion games with polynomial latency functions of maximum degree
d ≥ 2: polynomially-long sequences of best-response moves from any initial state
to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified
in such games as long as d is a constant.To the best of our knowledge, these are
the first positive algorithmic results for approximate pure Nash equilibria in
weighted congestion games. Our techniques significantly extend our recent work
on unweighted congestion games through the use of Ψ-games. The concept of approximating
nonpotential games by potential ones is interesting in itself and might have further
applications.'
article_number: '2'
author:
- first_name: Ioannis
full_name: Caragiannis, Ioannis
last_name: Caragiannis
- first_name: Angelo
full_name: Fanelli, Angelo
last_name: Fanelli
- first_name: Nick
full_name: Gravin, Nick
last_name: Gravin
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria
in Weighted Congestion Games: Existence, Efficient Computation, and Structure.
Transactions on Economics and Computation. 2015;3(1). doi:10.1145/2614687'
apa: 'Caragiannis, I., Fanelli, A., Gravin, N., & Skopalik, A. (2015). Approximate
Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure. Transactions on Economics and Computation, 3(1).
https://doi.org/10.1145/2614687'
bibtex: '@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure
Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure}, volume={3}, DOI={10.1145/2614687},
number={12}, journal={Transactions on Economics and Computation}, publisher={ACM},
author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik,
Alexander}, year={2015} }'
chicago: 'Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
“Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient
Computation, and Structure.” Transactions on Economics and Computation
3, no. 1 (2015). https://doi.org/10.1145/2614687.'
ieee: 'I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure
Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure,” Transactions on Economics and Computation, vol. 3, no.
1, 2015.'
mla: 'Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted
Congestion Games: Existence, Efficient Computation, and Structure.” Transactions
on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.'
short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics
and Computation 3 (2015).
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:04Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/2614687
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:40:55Z
date_updated: 2018-03-20T07:40:55Z
file_id: '1433'
file_name: 320-a2-caragiannis.pdf
file_size: 260503
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:40:55Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '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
publication: Transactions on Economics and Computation
publisher: ACM
status: public
title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence,
Efficient Computation, and Structure'
type: journal_article
user_id: '477'
volume: 3
year: '2015'
...
---
_id: '321'
author:
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
citation:
ama: Eidens F. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption.
Universität Paderborn; 2015.
apa: Eidens, F. (2015). Anonymous credential system based on q-Strong Diffie-Hellman
Assumption. Universität Paderborn.
bibtex: '@book{Eidens_2015, title={Anonymous credential system based on q-Strong
Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens,
Fabian}, year={2015} }'
chicago: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
ieee: F. Eidens, Anonymous credential system based on q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
mla: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
short: F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:40:22Z
date_updated: 2018-03-20T07:40:22Z
file_id: '1432'
file_name: 321-eidens_masterthesis_01.pdf
file_size: 879285
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:40:22Z
has_accepted_license: '1'
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
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Anonymous credential system based on q-Strong Diffie-Hellman Assumption
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '322'
abstract:
- lang: eng
text: Reputation systems are used to compute and publish reputation scores for services
or products. We consider reputation systems where users are allowed to rate products
that they purchased previously. To obtain trustworthy reputations, they are allowed
to rate these products only once. As long as users rate products once, they stay
anonymous. Everybody is able to detect users deviating from the rate-products-only-once
policy and the anonymity of such dishonest users can be revoked by a system manager.
In this paper we present formal models for such reputation systems and their security.
Based on group signatures presented by Boneh, Boyen, and Shacham we design an
efficient reputation system that meets all our requirements.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
citation:
ama: 'Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems.
In: Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29'
apa: Blömer, J., Juhnke, J., & Kolb, C. (2015). Anonymous and Publicly Linkable
Reputation Systems. In Proceedings of the 18th International Conference on
Financial Cryptography and Data Security (FC) (pp. 478--488). https://doi.org/10.1007/978-3-662-47854-7_29
bibtex: '@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous
and Publicly Linkable Reputation Systems}, DOI={10.1007/978-3-662-47854-7_29},
booktitle={Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb,
Christina}, year={2015}, pages={478--488}, collection={LNCS} }'
chicago: Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly
Linkable Reputation Systems.” In Proceedings of the 18th International Conference
on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015. https://doi.org/10.1007/978-3-662-47854-7_29.
ieee: J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation
Systems,” in Proceedings of the 18th International Conference on Financial
Cryptography and Data Security (FC), 2015, pp. 478--488.
mla: Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.”
Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.
short: 'J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International
Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.'
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1007/978-3-662-47854-7_29
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:39:54Z
date_updated: 2018-03-20T07:39:54Z
file_id: '1431'
file_name: 322-546_01.pdf
file_size: 499568
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:39:54Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/546
oa: '1'
page: 478--488
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 18th International Conference on Financial Cryptography
and Data Security (FC)
series_title: LNCS
status: public
title: Anonymous and Publicly Linkable Reputation Systems
type: conference
user_id: '48090'
year: '2015'
...
---
_id: '323'
abstract:
- lang: eng
text: On-the-fly composition of service-based software solutions is still a challenging
task. Even more challenges emerge when facing automatic service composition in
markets of composed services for end users. In this paper, we focus on the functional
discrepancy between “what a user wants” specified in terms of a request and “what
a user gets” when executing a composed service. To meet the challenge of functional
discrepancy, we propose the combination of existing symbolic composition approaches
with machine learning techniques. We developed a learning recommendation system
that expands the capabilities of existing composition algorithms to facilitate
adaptivity and consequently reduces functional discrepancy. As a representative
of symbolic techniques, an Artificial Intelligence planning based approach produces
solutions that are correct with respect to formal specifications. Our learning
recommendation system supports the symbolic approach in decision-making. Reinforcement
Learning techniques enable the recommendation system to adjust its recommendation
strategy over time based on user ratings. We implemented the proposed functionality
in terms of a prototypical composition framework. Preliminary results from experiments
conducted in the image processing domain illustrate the benefit of combining both
complementary techniques.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
citation:
ama: Jungmann A, Mohr F. An approach towards adaptive service composition in markets
of composed services. Journal of Internet Services and Applications. 2015;(1):1-18.
doi:10.1186/s13174-015-0022-8
apa: Jungmann, A., & Mohr, F. (2015). An approach towards adaptive service composition
in markets of composed services. Journal of Internet Services and Applications,
(1), 1–18. https://doi.org/10.1186/s13174-015-0022-8
bibtex: '@article{Jungmann_Mohr_2015, title={An approach towards adaptive service
composition in markets of composed services}, DOI={10.1186/s13174-015-0022-8},
number={1}, journal={Journal of Internet Services and Applications}, publisher={Springer},
author={Jungmann, Alexander and Mohr, Felix}, year={2015}, pages={1–18} }'
chicago: 'Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service
Composition in Markets of Composed Services.” Journal of Internet Services
and Applications, no. 1 (2015): 1–18. https://doi.org/10.1186/s13174-015-0022-8.'
ieee: A. Jungmann and F. Mohr, “An approach towards adaptive service composition
in markets of composed services,” Journal of Internet Services and Applications,
no. 1, pp. 1–18, 2015.
mla: Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service
Composition in Markets of Composed Services.” Journal of Internet Services
and Applications, no. 1, Springer, 2015, pp. 1–18, doi:10.1186/s13174-015-0022-8.
short: A. Jungmann, F. Mohr, Journal of Internet Services and Applications (2015)
1–18.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:06Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1186/s13174-015-0022-8
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:39:17Z
date_updated: 2018-03-20T07:39:17Z
file_id: '1429'
file_name: 323-An_approach_towards_adaptive_service_composition_in_markets_of_composed_services.pdf
file_size: 2842281
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:39:17Z
has_accepted_license: '1'
issue: '1'
language:
- iso: eng
page: 1-18
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Journal of Internet Services and Applications
publisher: Springer
status: public
title: An approach towards adaptive service composition in markets of composed services
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '324'
abstract:
- lang: eng
text: Services are self-contained software components that can beused platform independent
and that aim at maximizing software reuse. Abasic concern in service oriented
architectures is to measure the reusabilityof services. One of the most important
qualities is the functionalreusability, which indicates how relevant the task
is that a service solves.Current metrics for functional reusability of software,
however, have verylittle explanatory power and do not accomplish this goal.This
paper presents a new approach to estimate the functional reusabilityof services
based on their relevance. To this end, it denes the degreeto which a service enables
the execution of other services as its contri-bution. Based on the contribution,
relevance of services is dened as anestimation for their functional reusability.
Explanatory power is obtainedby normalizing relevance values with a reference
service. The applicationof the metric to a service test set conrms its supposed
capabilities.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
citation:
ama: 'Mohr F. A Metric for Functional Reusability of Services. In: Proceedings
of the 14th International Conference on Software Reuse (ICSR). LNCS. ; 2015:298--313.
doi:10.1007/978-3-319-14130-5_21'
apa: Mohr, F. (2015). A Metric for Functional Reusability of Services. In Proceedings
of the 14th International Conference on Software Reuse (ICSR) (pp. 298--313).
https://doi.org/10.1007/978-3-319-14130-5_21
bibtex: '@inproceedings{Mohr_2015, series={LNCS}, title={A Metric for Functional
Reusability of Services}, DOI={10.1007/978-3-319-14130-5_21},
booktitle={Proceedings of the 14th International Conference on Software Reuse
(ICSR)}, author={Mohr, Felix}, year={2015}, pages={298--313}, collection={LNCS}
}'
chicago: Mohr, Felix. “A Metric for Functional Reusability of Services.” In Proceedings
of the 14th International Conference on Software Reuse (ICSR), 298--313. LNCS,
2015. https://doi.org/10.1007/978-3-319-14130-5_21.
ieee: F. Mohr, “A Metric for Functional Reusability of Services,” in Proceedings
of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313.
mla: Mohr, Felix. “A Metric for Functional Reusability of Services.” Proceedings
of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313,
doi:10.1007/978-3-319-14130-5_21.
short: 'F. Mohr, in: Proceedings of the 14th International Conference on Software
Reuse (ICSR), 2015, pp. 298--313.'
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1007/978-3-319-14130-5_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:38:44Z
date_updated: 2018-03-20T07:38:44Z
file_id: '1428'
file_name: 324-ICSR-Mohr-15.pdf
file_size: 569475
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:38:44Z
has_accepted_license: '1'
language:
- iso: eng
page: 298--313
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 14th International Conference on Software Reuse (ICSR)
series_title: LNCS
status: public
title: A Metric for Functional Reusability of Services
type: conference
user_id: '477'
year: '2015'
...
---
_id: '325'
author:
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: Löken N. A Group Signature Scheme with Distributed Group Management - An
Application of Threshold Encryption. Universität Paderborn; 2015.
apa: Löken, N. (2015). A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn.
bibtex: '@book{Löken_2015, title={A Group Signature Scheme with Distributed Group
Management - An Application of Threshold Encryption}, publisher={Universität Paderborn},
author={Löken, Nils}, year={2015} }'
chicago: Löken, Nils. A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn, 2015.
ieee: N. Löken, A Group Signature Scheme with Distributed Group Management -
An Application of Threshold Encryption. Universität Paderborn, 2015.
mla: Löken, Nils. A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn, 2015.
short: N. Löken, A Group Signature Scheme with Distributed Group Management - An
Application of Threshold Encryption, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '64'
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
related_material:
record:
- id: '253'
relation: other
status: public
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: A Group Signature Scheme with Distributed Group Management - An Application
of Threshold Encryption
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '326'
author:
- first_name: Frederic
full_name: Heihoff, Frederic
last_name: Heihoff
citation:
ama: Heihoff F. A Group Signature Scheme Based on the LSRW Assumption. Universität
Paderborn; 2015.
apa: Heihoff, F. (2015). A group signature scheme based on the LSRW assumption.
Universität Paderborn.
bibtex: '@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption},
publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }'
chicago: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption.
Universität Paderborn, 2015.
ieee: F. Heihoff, A group signature scheme based on the LSRW assumption.
Universität Paderborn, 2015.
mla: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption.
Universität Paderborn, 2015.
short: F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '64'
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
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: A group signature scheme based on the LSRW assumption
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '327'
abstract:
- lang: eng
text: We consider the problem of resource discovery in distributed systems. In particular
we give an algorithm, such that each node in a network discovers the address of
any other node in the network. We model the knowledge of the nodes as a virtual
overlay network given by a directed graph such that complete knowledge of all
nodes corresponds to a complete graph in the overlay network. Although there are
several solutions for resource discovery, our solution is the first that achieves
worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n))
or bits (O(nlogn)O(nlogn)) a node receives or sends coincides with the lower
bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message
complexity optimal solution for resource discovery. Theoretical Computer Science.
2015:67-79. doi:10.1016/j.tcs.2014.11.027
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2015). A deterministic
worst-case message complexity optimal solution for resource discovery. Theoretical
Computer Science, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027
bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic
worst-case message complexity optimal solution for resource discovery}, DOI={10.1016/j.tcs.2014.11.027},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges,
Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79}
}'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
Theoretical Computer Science, 2015, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case
message complexity optimal solution for resource discovery,” Theoretical Computer
Science, pp. 67–79, 2015.
mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery.” Theoretical Computer Science,
Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027.
short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science
(2015) 67–79.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:08Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2014.11.027
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:38:02Z
date_updated: 2018-03-20T07:38:02Z
file_id: '1427'
file_name: 327-KKS15-TOCS_01.pdf
file_size: 398044
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:38:02Z
has_accepted_license: '1'
page: 67-79
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: A deterministic worst-case message complexity optimal solution for resource
discovery
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3309'
author:
- first_name: Patrizia
full_name: Fanasch, Patrizia
last_name: Fanasch
citation:
ama: Fanasch P. Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
auf den Zusammenhang von Reputation und Unternehmenserfolg. Universität Paderborn;
2015.
apa: Fanasch, P. (2015). Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
auf den Zusammenhang von Reputation und Unternehmenserfolg. Universität Paderborn.
bibtex: '@book{Fanasch_2015, title={Erfolg durch Persönlichkeit? Der Einfluss der
Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg},
publisher={Universität Paderborn}, author={Fanasch, Patrizia}, year={2015} }'
chicago: Fanasch, Patrizia. Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
auf den Zusammenhang von Reputation und Unternehmenserfolg. Universität Paderborn,
2015.
ieee: P. Fanasch, Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
auf den Zusammenhang von Reputation und Unternehmenserfolg. Universität Paderborn,
2015.
mla: Fanasch, Patrizia. Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
auf den Zusammenhang von Reputation und Unternehmenserfolg. Universität Paderborn,
2015.
short: P. Fanasch, Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
auf den Zusammenhang von Reputation und Unternehmenserfolg, Universität Paderborn,
2015.
date_created: 2018-06-22T11:57:31Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
title: Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den
Zusammenhang von Reputation und Unternehmenserfolg
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '3310'
author:
- first_name: Gregor Paul
full_name: Walczok, Gregor Paul
last_name: Walczok
citation:
ama: Walczok GP. Die Veränderung des Mobilfunkmarktes durch die Discountanbieter.
Universität Paderborn; 2015.
apa: Walczok, G. P. (2015). Die Veränderung des Mobilfunkmarktes durch die Discountanbieter.
Universität Paderborn.
bibtex: '@book{Walczok_2015, title={Die Veränderung des Mobilfunkmarktes durch die
Discountanbieter}, publisher={Universität Paderborn}, author={Walczok, Gregor
Paul}, year={2015} }'
chicago: Walczok, Gregor Paul. Die Veränderung des Mobilfunkmarktes durch die
Discountanbieter. Universität Paderborn, 2015.
ieee: G. P. Walczok, Die Veränderung des Mobilfunkmarktes durch die Discountanbieter.
Universität Paderborn, 2015.
mla: Walczok, Gregor Paul. Die Veränderung des Mobilfunkmarktes durch die Discountanbieter.
Universität Paderborn, 2015.
short: G.P. Walczok, Die Veränderung des Mobilfunkmarktes durch die Discountanbieter,
Universität Paderborn, 2015.
date_created: 2018-06-22T11:59:36Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
title: Die Veränderung des Mobilfunkmarktes durch die Discountanbieter
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '3343'
abstract:
- lang: eng
text: In this paper we consider an extended variant of query learning where the
hidden concept is embedded in some Boolean circuit. This additional processing
layer modifies query arguments and answers by fixed transformation functions which
are known to the learner. For this scenario, we provide a characterization of
the solution space and an ordering on it. We give a compact representation of
the minimal and maximal solutions as quantified Boolean formulas and we adapt
the original algorithms for exact learning of specific classes of propositional
formulas.
author:
- first_name: Uwe
full_name: Bubeck, Uwe
last_name: Bubeck
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: Bubeck U, Kleine Büning H. Learning Boolean Specifications. Artificial Intelligence.
2015:246-257. doi:10.1016/j.artint.2015.09.003
apa: Bubeck, U., & Kleine Büning, H. (2015). Learning Boolean Specifications.
Artificial Intelligence, 246–257. https://doi.org/10.1016/j.artint.2015.09.003
bibtex: '@article{Bubeck_Kleine Büning_2015, title={Learning Boolean Specifications},
DOI={10.1016/j.artint.2015.09.003},
journal={Artificial Intelligence}, publisher={Elsevier}, author={Bubeck, Uwe and
Kleine Büning, Hans}, year={2015}, pages={246–257} }'
chicago: Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.”
Artificial Intelligence, 2015, 246–57. https://doi.org/10.1016/j.artint.2015.09.003.
ieee: U. Bubeck and H. Kleine Büning, “Learning Boolean Specifications,” Artificial
Intelligence, pp. 246–257, 2015.
mla: Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” Artificial
Intelligence, Elsevier, 2015, pp. 246–57, doi:10.1016/j.artint.2015.09.003.
short: U. Bubeck, H. Kleine Büning, Artificial Intelligence (2015) 246–257.
date_created: 2018-06-25T10:43:19Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1016/j.artint.2015.09.003
keyword:
- Query learning
- Propositional logic
language:
- iso: eng
page: 246 - 257
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Artificial Intelligence
publication_identifier:
issn:
- 0004-3702
publisher: Elsevier
status: public
title: Learning Boolean Specifications
type: journal_article
user_id: '315'
year: '2015'
...
---
_id: '3364'
author:
- first_name: Christoph
full_name: Knorr, Christoph
last_name: Knorr
citation:
ama: Knorr C. Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten.
Universität Paderborn; 2015.
apa: Knorr, C. (2015). Evaluation von Bildverarbeitungsalgorithmen in heterogenen
Rechenknoten. Universität Paderborn.
bibtex: '@book{Knorr_2015, title={Evaluation von Bildverarbeitungsalgorithmen in
heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph},
year={2015} }'
chicago: Knorr, Christoph. Evaluation von Bildverarbeitungsalgorithmen in heterogenen
Rechenknoten. Universität Paderborn, 2015.
ieee: C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten.
Universität Paderborn, 2015.
mla: Knorr, Christoph. Evaluation von Bildverarbeitungsalgorithmen in heterogenen
Rechenknoten. Universität Paderborn, 2015.
short: C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten,
Universität Paderborn, 2015.
date_created: 2018-06-26T14:06:07Z
date_updated: 2022-01-06T06:59:13Z
department:
- _id: '78'
language:
- iso: ger
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '288'
abstract:
- lang: eng
text: Experience goods are characterised by information asymmetry and a lack of
ex ante knowledge of product quality, such that reliable external signals of quality
are likely to be highly valued. Two potentially credible sources of such information
are reviews from professional critics and ‘word of mouth’ from other consumers.
This paper makes a direct comparison between the relative influences and interactions
of reviews from both of these sources on the sales performance of video game software.
In order to empirically estimate and separate the effects of the two signals,
we analyze a sample of 1480 video games and their sales figures between 2004 and
2010. We find evidence to suggest that even after taking steps to control for
endogeneity, reviews from professional critics have a significantly positive influence
on sales which outweighs that from consumer reviews. We also find evidence to
suggest that reviews from professional critics also interact significantly with
other signals of product quality. Consequently, we contend that professional critics
adopt the role of an influencer, whereas word-of-mouth opinion acts more as a
predictor of sales in the market for video games.
author:
- first_name: Joe
full_name: Cox, Joe
last_name: Cox
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
citation:
ama: Cox J, Kaimann D. How do reviews from professional critics interact with other
signals of product quality? Evidence from the video game industry. Journal
of Consumer Behaviour. 2015;14(6):366-377. doi:10.1002/cb.1553
apa: Cox, J., & Kaimann, D. (2015). How do reviews from professional critics
interact with other signals of product quality? Evidence from the video game industry.
Journal of Consumer Behaviour, 14(6), 366–377. https://doi.org/10.1002/cb.1553
bibtex: '@article{Cox_Kaimann_2015, title={How do reviews from professional critics
interact with other signals of product quality? Evidence from the video game industry},
volume={14}, DOI={10.1002/cb.1553},
number={6}, journal={Journal of Consumer Behaviour}, publisher={Wiley Online Library},
author={Cox, Joe and Kaimann, Daniel}, year={2015}, pages={366–377} }'
chicago: 'Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics
Interact with Other Signals of Product Quality? Evidence from the Video Game Industry.”
Journal of Consumer Behaviour 14, no. 6 (2015): 366–77. https://doi.org/10.1002/cb.1553.'
ieee: J. Cox and D. Kaimann, “How do reviews from professional critics interact
with other signals of product quality? Evidence from the video game industry,”
Journal of Consumer Behaviour, vol. 14, no. 6, pp. 366–377, 2015.
mla: Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics Interact
with Other Signals of Product Quality? Evidence from the Video Game Industry.”
Journal of Consumer Behaviour, vol. 14, no. 6, Wiley Online Library, 2015,
pp. 366–77, doi:10.1002/cb.1553.
short: J. Cox, D. Kaimann, Journal of Consumer Behaviour 14 (2015) 366–377.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:25Z
ddc:
- '040'
department:
- _id: '183'
doi: 10.1002/cb.1553
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:24:24Z
date_updated: 2018-03-21T09:24:24Z
file_id: '1467'
file_name: 288-Cox_et_al-2015-Journal_of_Consumer_Behaviour.pdf
file_size: 386704
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:24:24Z
has_accepted_license: '1'
intvolume: ' 14'
issue: '6'
language:
- iso: eng
page: 366-377
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Journal of Consumer Behaviour
publisher: Wiley Online Library
status: public
title: How do reviews from professional critics interact with other signals of product
quality? Evidence from the video game industry
type: journal_article
user_id: '18949'
volume: 14
year: '2015'
...
---
_id: '289'
abstract:
- lang: eng
text: We examine the effect of the variance of consumer ratings on product pricing
and sales using an analytical model, which considers goods that are characterized
by experience attributes and informed search attributes (i.e., experience attributes
that were transformed in search attributes by consumer ratings). For pure informed
search goods, equilibrium price increases and demand decreases in variance. For
pure experience goods, equilibrium price and demand decrease in variance. For
hybrid goods with low total variance, equilibrium price and demand increase with
an increasing relative share of variance caused by informed search attributes
when the average rating and total variance of ratings are held constant. Hence,
risk-averse consumers may prefer a more expensive good with a higher variance
of ratings out of two similar goods with the same average rating. Moreover, our
analytical model provides a theoretical foundation for the empirically observed
j-shaped distribution of consumer ratings in electronic commerce.
author:
- first_name: Philipp
full_name: Herrmann, Philipp
last_name: Herrmann
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Steffen
full_name: Zimmermann, Steffen
last_name: Zimmermann
- first_name: Barry
full_name: Nault, Barry
last_name: Nault
citation:
ama: 'Herrmann P, Kundisch D, Zimmermann S, Nault B. How do Different Sources of
the Variance of Consumer Ratings Matter? In: Proceedings of the 36th International
Conference on Information Systems (ICIS), Fort Worth. ; 2015.'
apa: Herrmann, P., Kundisch, D., Zimmermann, S., & Nault, B. (2015). How do
Different Sources of the Variance of Consumer Ratings Matter? In Proceedings
of the 36th International Conference on Information Systems (ICIS), Fort Worth.
Forth Worth, USA.
bibtex: '@inproceedings{Herrmann_Kundisch_Zimmermann_Nault_2015, title={How do Different
Sources of the Variance of Consumer Ratings Matter?}, booktitle={Proceedings of
the 36th International Conference on Information Systems (ICIS), Fort Worth},
author={Herrmann, Philipp and Kundisch, Dennis and Zimmermann, Steffen and Nault,
Barry}, year={2015} }'
chicago: Herrmann, Philipp, Dennis Kundisch, Steffen Zimmermann, and Barry Nault.
“How Do Different Sources of the Variance of Consumer Ratings Matter?” In Proceedings
of the 36th International Conference on Information Systems (ICIS), Fort Worth,
2015.
ieee: P. Herrmann, D. Kundisch, S. Zimmermann, and B. Nault, “How do Different Sources
of the Variance of Consumer Ratings Matter?,” in Proceedings of the 36th International
Conference on Information Systems (ICIS), Fort Worth, Forth Worth, USA, 2015.
mla: Herrmann, Philipp, et al. “How Do Different Sources of the Variance of Consumer
Ratings Matter?” Proceedings of the 36th International Conference on Information
Systems (ICIS), Fort Worth, 2015.
short: 'P. Herrmann, D. Kundisch, S. Zimmermann, B. Nault, in: Proceedings of the
36th International Conference on Information Systems (ICIS), Fort Worth, 2015.'
conference:
location: Forth Worth, USA
name: 36th International Conference on Information Systems (ICIS)
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:40Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:22:36Z
date_updated: 2018-03-21T09:22:36Z
file_id: '1465'
file_name: 289-How_do_Different_Sources_of_the_Variance_of_Consumer_Ratings_Matt.pdf
file_size: 349683
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:22:36Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 36th International Conference on Information Systems
(ICIS), Fort Worth
status: public
title: How do Different Sources of the Variance of Consumer Ratings Matter?
type: conference
user_id: '16205'
year: '2015'
...
---
_id: '290'
abstract:
- lang: eng
text: 'Model transformation is a key concept in model-driven software engineering.
The definition of model transformations is usually based on meta-models describing
the abstract syntax of languages. While meta-models are thereby able to abstract
from uperfluous details of concrete syntax, they often loose structural information
inherent in languages, like information on model elements always occurring together
in particular shapes. As a consequence, model transformations cannot naturally
re-use language structures, thus leading to unnecessary complexity in their development
as well as in quality assurance.In this paper, we propose a new approach to model
transformation development which allows to simplify the developed transformations
and improve their quality via the exploitation of the languages׳ structures. The
approach is based on context-free graph grammars and transformations defined by
pairing productions of source and target grammars. We show that such transformations
have important properties: they terminate and are sound, complete, and deterministic.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition,
execution, and quality properties. Computer Languages, Systems & Structures.
2015:116-138. doi:10.1016/j.cl.2015.05.003'
apa: 'Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations:
Definition, execution, and quality properties. Computer Languages, Systems
& Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003'
bibtex: '@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations:
Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003},
journal={Computer Languages, Systems & Structures}, publisher={Elsevier},
author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015},
pages={116–138} }'
chicago: 'Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model
Transformations: Definition, Execution, and Quality Properties.” Computer Languages,
Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.'
ieee: 'G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations:
Definition, execution, and quality properties,” Computer Languages, Systems
& Structures, pp. 116–138, 2015.'
mla: 'Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution,
and Quality Properties.” Computer Languages, Systems & Structures,
Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.'
short: G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures
(2015) 116–138.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.cl.2015.05.003
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:22:03Z
date_updated: 2018-03-21T09:22:03Z
file_id: '1464'
file_name: 290-BSW15-main.pdf
file_size: 1329478
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:22:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 116-138
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Languages, Systems & Structures
publisher: Elsevier
status: public
title: 'Grammar-based model transformations: Definition, execution, and quality properties'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '291'
author:
- first_name: Paul
full_name: Börding, Paul
last_name: Börding
citation:
ama: Börding P. Fuzzy Matching von Vor- und Nachbedingungen in Servicespezikationen.
Universität Paderborn; 2015.
apa: Börding, P. (2015). Fuzzy Matching von Vor- und Nachbedingungen in Servicespezikationen.
Universität Paderborn.
bibtex: '@book{Börding_2015, title={Fuzzy Matching von Vor- und Nachbedingungen
in Servicespezikationen}, publisher={Universität Paderborn}, author={Börding,
Paul}, year={2015} }'
chicago: Börding, Paul. Fuzzy Matching von Vor- und Nachbedingungen in Servicespezikationen.
Universität Paderborn, 2015.
ieee: P. Börding, Fuzzy Matching von Vor- und Nachbedingungen in Servicespezikationen.
Universität Paderborn, 2015.
mla: Börding, Paul. Fuzzy Matching von Vor- und Nachbedingungen in Servicespezikationen.
Universität Paderborn, 2015.
short: P. Börding, Fuzzy Matching von Vor- und Nachbedingungen in Servicespezikationen,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:46Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Fuzzy Matching von Vor- und Nachbedingungen in Servicespezikationen
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '292'
author:
- first_name: Christina
full_name: Osburg, Christina
last_name: Osburg
citation:
ama: Osburg C. Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
und Wechselwirkungen. Universität Paderborn; 2015.
apa: Osburg, C. (2015). Fusionen von gesetzlichen Krankenversicherungen zu den
Effizienz- und Wechselwirkungen. Universität Paderborn.
bibtex: '@book{Osburg_2015, title={Fusionen von gesetzlichen Krankenversicherungen
zu den Effizienz- und Wechselwirkungen}, publisher={Universität Paderborn}, author={Osburg,
Christina}, year={2015} }'
chicago: Osburg, Christina. Fusionen von gesetzlichen Krankenversicherungen zu
den Effizienz- und Wechselwirkungen. Universität Paderborn, 2015.
ieee: C. Osburg, Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
und Wechselwirkungen. Universität Paderborn, 2015.
mla: Osburg, Christina. Fusionen von gesetzlichen Krankenversicherungen zu den
Effizienz- und Wechselwirkungen. Universität Paderborn, 2015.
short: C. Osburg, Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
und Wechselwirkungen, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '280'
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
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '293'
abstract:
- lang: eng
text: Opinion mining from physician rating websites depends on the quality of the
extracted information. Sometimes reviews are user-error prone and the assigned
stars or grades contradict the associated content. We therefore aim at detecting
random individual error within reviews. Such errors comprise the disagreement
in polarity of review texts and the respective ratings. The challenges that thereby
arise are (1) the content and sentiment analysis of the review texts and (2) the
removal of the random individual errors contained therein. To solve these tasks,
we assign polarities to automatically recognized opinion phrases in reviews and
then check for divergence in rating and text polarity. The novelty of our approach
is that we improve user-generated data quality by excluding error-prone reviews
on German physician websites from average ratings.
author:
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Sabine
full_name: Schulze, Sabine
last_name: Schulze
- first_name: Valentina
full_name: Stuß, Valentina
last_name: Stuß
citation:
ama: 'Geierhos M, Bäumer FS, Schulze S, Stuß V. Filtering Reviews by Random Individual
Error. In: Ali M, Kwon YS, Lee C-H, Kim J, Kim Y, eds. Proceedings of the 28th
International Conference on Industrial, Engineering and Other Applications of
Applied Intelligent Systems (IEA/AIE 2015). Vol 9101. Lecture Notes in Artificial
Intelligence. Cham, Switzerland: Springer; 2015:305-315. doi:10.1007/978-3-319-19066-2_30'
apa: 'Geierhos, M., Bäumer, F. S., Schulze, S., & Stuß, V. (2015). Filtering
Reviews by Random Individual Error. In M. Ali, Y. S. Kwon, C.-H. Lee, J. Kim,
& Y. Kim (Eds.), Proceedings of the 28th International Conference on Industrial,
Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)
(Vol. 9101, pp. 305–315). Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-19066-2_30'
bibtex: '@inbook{Geierhos_Bäumer_Schulze_Stuß_2015, place={Cham, Switzerland}, series={Lecture
Notes in Artificial Intelligence}, title={Filtering Reviews by Random Individual
Error}, volume={9101}, DOI={10.1007/978-3-319-19066-2_30},
booktitle={Proceedings of the 28th International Conference on Industrial, Engineering
and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)}, publisher={Springer},
author={Geierhos, Michaela and Bäumer, Frederik Simon and Schulze, Sabine and
Stuß, Valentina}, editor={Ali, Moonis and Kwon, Young Sig and Lee, Chang-Hwan
and Kim, Juntae and Kim, Yongdai Editors}, year={2015}, pages={305–315}, collection={Lecture
Notes in Artificial Intelligence} }'
chicago: 'Geierhos, Michaela, Frederik Simon Bäumer, Sabine Schulze, and Valentina
Stuß. “Filtering Reviews by Random Individual Error.” In Proceedings of the
28th International Conference on Industrial, Engineering and Other Applications
of Applied Intelligent Systems (IEA/AIE 2015), edited by Moonis Ali, Young
Sig Kwon, Chang-Hwan Lee, Juntae Kim, and Yongdai Kim, 9101:305–15. Lecture
Notes in Artificial Intelligence. Cham, Switzerland: Springer, 2015. https://doi.org/10.1007/978-3-319-19066-2_30.'
ieee: 'M. Geierhos, F. S. Bäumer, S. Schulze, and V. Stuß, “Filtering Reviews by
Random Individual Error,” in Proceedings of the 28th International Conference
on Industrial, Engineering and Other Applications of Applied Intelligent Systems
(IEA/AIE 2015), vol. 9101, M. Ali, Y. S. Kwon, C.-H. Lee, J. Kim, and Y. Kim,
Eds. Cham, Switzerland: Springer, 2015, pp. 305–315.'
mla: Geierhos, Michaela, et al. “Filtering Reviews by Random Individual Error.”
Proceedings of the 28th International Conference on Industrial, Engineering
and Other Applications of Applied Intelligent Systems (IEA/AIE 2015), edited
by Moonis Ali et al., vol. 9101, Springer, 2015, pp. 305–15, doi:10.1007/978-3-319-19066-2_30.
short: 'M. Geierhos, F.S. Bäumer, S. Schulze, V. Stuß, in: M. Ali, Y.S. Kwon, C.-H.
Lee, J. Kim, Y. Kim (Eds.), Proceedings of the 28th International Conference on
Industrial, Engineering and Other Applications of Applied Intelligent Systems
(IEA/AIE 2015), Springer, Cham, Switzerland, 2015, pp. 305–315.'
conference:
end_date: 2015-06-12
location: Seoul, South Korea
name: 28th International Conference on Industrial, Engineering and Other Applications
of Applied Intelligent Systems (IEA/AIE 2015)
start_date: 2015-06-10
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:47Z
ddc:
- '040'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.1007/978-3-319-19066-2_30
editor:
- first_name: 'Moonis '
full_name: 'Ali, Moonis '
last_name: Ali
- first_name: Young Sig
full_name: Kwon, Young Sig
last_name: Kwon
- first_name: Chang-Hwan
full_name: Lee, Chang-Hwan
last_name: Lee
- first_name: 'Juntae '
full_name: 'Kim, Juntae '
last_name: Kim
- first_name: 'Yongdai '
full_name: 'Kim, Yongdai '
last_name: Kim
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:21:30Z
date_updated: 2018-03-21T09:21:30Z
file_id: '1463'
file_name: 293-IEA_AIE2015.pdf
file_size: 292847
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:21:30Z
has_accepted_license: '1'
intvolume: ' 9101'
language:
- iso: eng
page: 305-315
place: Cham, Switzerland
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 28th International Conference on Industrial, Engineering
and Other Applications of Applied Intelligent Systems (IEA/AIE 2015)
publication_identifier:
eisbn:
- 978-3-319-19066-2
isbn:
- 978-3-319-19065-5
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Lecture Notes in Artificial Intelligence
status: public
title: Filtering Reviews by Random Individual Error
type: book_chapter
user_id: '42496'
volume: 9101
year: '2015'
...
---
_id: '294'
author:
- first_name: GinaJoanna
full_name: Materna, GinaJoanna
last_name: Materna
citation:
ama: Materna G. Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik.
Universität Paderborn; 2015.
apa: Materna, G. (2015). Fair Trade - Eine neue Perspektive in der internationalen
Handelspolitik. Universität Paderborn.
bibtex: '@book{Materna_2015, title={Fair Trade - Eine neue Perspektive in der internationalen
Handelspolitik}, publisher={Universität Paderborn}, author={Materna, GinaJoanna},
year={2015} }'
chicago: Materna, GinaJoanna. Fair Trade - Eine neue Perspektive in der internationalen
Handelspolitik. Universität Paderborn, 2015.
ieee: G. Materna, Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik.
Universität Paderborn, 2015.
mla: Materna, GinaJoanna. Fair Trade - Eine neue Perspektive in der internationalen
Handelspolitik. Universität Paderborn, 2015.
short: G. Materna, Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:48Z
department:
- _id: '280'
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
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik
type: bachelorsthesis
user_id: '42447'
year: '2015'
...