---
_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: '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: '3815'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Wachsmuth H, Kiesel J, Stein B. Sentiment Flow - A General Model of Web Review
Argumentation. In: Tsujii J, Hajic J, eds. Proceedings of the 2015 Conference
on Empirical Methods in Natural Language Processing. Lecture Notes in Computer
Science. ; 2015:601-611. doi:10.18653/v1/D15-1072'
apa: Wachsmuth, H., Kiesel, J., & Stein, B. (2015). Sentiment Flow - A General
Model of Web Review Argumentation. In J. Tsujii & J. Hajic (Eds.), Proceedings
of the 2015 Conference on Empirical Methods in Natural Language Processing
(pp. 601–611). https://doi.org/10.18653/v1/D15-1072
bibtex: '@inproceedings{Wachsmuth_Kiesel_Stein_2015, series={Lecture Notes in Computer
Science}, title={Sentiment Flow - A General Model of Web Review Argumentation},
DOI={10.18653/v1/D15-1072},
booktitle={Proceedings of the 2015 Conference on Empirical Methods in Natural
Language Processing}, author={Wachsmuth, Henning and Kiesel, Johannes and Stein,
Benno}, editor={Tsujii, Junichi and Hajic, JanEditors}, year={2015}, pages={601–611},
collection={Lecture Notes in Computer Science} }'
chicago: Wachsmuth, Henning, Johannes Kiesel, and Benno Stein. “Sentiment Flow -
A General Model of Web Review Argumentation.” In Proceedings of the 2015 Conference
on Empirical Methods in Natural Language Processing, edited by Junichi Tsujii
and Jan Hajic, 601–11. Lecture Notes in Computer Science, 2015. https://doi.org/10.18653/v1/D15-1072.
ieee: H. Wachsmuth, J. Kiesel, and B. Stein, “Sentiment Flow - A General Model of
Web Review Argumentation,” in Proceedings of the 2015 Conference on Empirical
Methods in Natural Language Processing, 2015, pp. 601–611.
mla: Wachsmuth, Henning, et al. “Sentiment Flow - A General Model of Web Review
Argumentation.” Proceedings of the 2015 Conference on Empirical Methods in
Natural Language Processing, edited by Junichi Tsujii and Jan Hajic, 2015,
pp. 601–11, doi:10.18653/v1/D15-1072.
short: 'H. Wachsmuth, J. Kiesel, B. Stein, in: J. Tsujii, J. Hajic (Eds.), Proceedings
of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015,
pp. 601–611.'
date_created: 2018-08-02T13:38:41Z
date_updated: 2022-01-06T06:59:37Z
department:
- _id: '600'
doi: 10.18653/v1/D15-1072
editor:
- first_name: Junichi
full_name: Tsujii, Junichi
last_name: Tsujii
- first_name: Jan
full_name: Hajic, Jan
last_name: Hajic
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/D15-1072.pdf
page: 601-611
publication: Proceedings of the 2015 Conference on Empirical Methods in Natural Language
Processing
publication_identifier:
isbn:
- 978-3-319-25740-2
series_title: Lecture Notes in Computer Science
status: public
title: Sentiment Flow - A General Model of Web Review Argumentation
type: conference
user_id: '82920'
year: '2015'
...
---
_id: '3845'
abstract:
- lang: eng
text: The device principle of a prism-based on-chip spectrometer for TE polarization
is introduced. The spectrometer exploits the modal dispersion in planar waveguides
in a layout with slab regions having two different thicknesses of the guiding
layer. The set-up uses parabolic mirrors, for the collimation of light of the
input waveguide and focusing of the light to the receiver waveguides, which relies
on total internal reflection at the interface between two such regions. These
regions are connected adiabatically to prevent unwanted mode conversion and loss
at the edges of the prism. The structure can be fabricated with two wet etching
steps. The paper presents basic theory and a general approach for device optimization.
The latter is illustrated with a numerical example assuming SiON technology.
article_type: original
author:
- first_name: F.
full_name: Civitci, F.
last_name: Civitci
- first_name: Manfred
full_name: Hammer, Manfred
id: '48077'
last_name: Hammer
orcid: 0000-0002-6331-9348
- first_name: H.J.W.M.
full_name: Hoekstra, H.J.W.M.
last_name: Hoekstra
citation:
ama: Civitci F, Hammer M, Hoekstra HJWM. Planar prism spectrometer based on adiabatically
connected waveguiding slabs. Optics Communications. 2015;365:29-37. doi:10.1016/j.optcom.2015.11.066
apa: Civitci, F., Hammer, M., & Hoekstra, H. J. W. M. (2015). Planar prism spectrometer
based on adiabatically connected waveguiding slabs. Optics Communications,
365, 29–37. https://doi.org/10.1016/j.optcom.2015.11.066
bibtex: '@article{Civitci_Hammer_Hoekstra_2015, title={Planar prism spectrometer
based on adiabatically connected waveguiding slabs}, volume={365}, DOI={10.1016/j.optcom.2015.11.066},
journal={Optics Communications}, publisher={Elsevier BV}, author={Civitci, F.
and Hammer, Manfred and Hoekstra, H.J.W.M.}, year={2015}, pages={29–37} }'
chicago: 'Civitci, F., Manfred Hammer, and H.J.W.M. Hoekstra. “Planar Prism Spectrometer
Based on Adiabatically Connected Waveguiding Slabs.” Optics Communications
365 (2015): 29–37. https://doi.org/10.1016/j.optcom.2015.11.066.'
ieee: F. Civitci, M. Hammer, and H. J. W. M. Hoekstra, “Planar prism spectrometer
based on adiabatically connected waveguiding slabs,” Optics Communications,
vol. 365, pp. 29–37, 2015.
mla: Civitci, F., et al. “Planar Prism Spectrometer Based on Adiabatically Connected
Waveguiding Slabs.” Optics Communications, vol. 365, Elsevier BV, 2015,
pp. 29–37, doi:10.1016/j.optcom.2015.11.066.
short: F. Civitci, M. Hammer, H.J.W.M. Hoekstra, Optics Communications 365 (2015)
29–37.
date_created: 2018-08-08T10:27:57Z
date_updated: 2022-01-06T06:59:44Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1016/j.optcom.2015.11.066
file:
- access_level: closed
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-08T10:31:23Z
date_updated: 2018-08-08T10:31:23Z
file_id: '3846'
file_name: 2016 Hammer_Planar prism spectrometer based on adiabatically connected
waveguiding slabs.pdf
file_size: 1542539
relation: main_file
success: 1
file_date_updated: 2018-08-08T10:31:23Z
has_accepted_license: '1'
intvolume: ' 365'
keyword:
- tet_topic_waveguide
language:
- iso: eng
page: 29-37
publication: Optics Communications
publication_identifier:
issn:
- 0030-4018
publication_status: published
publisher: Elsevier BV
status: public
title: Planar prism spectrometer based on adiabatically connected waveguiding slabs
type: journal_article
user_id: '55706'
volume: 365
year: '2015'
...
---
_id: '3847'
abstract:
- lang: eng
text: "Sheets of slab waveguides with sharp corners are investigated. By means of
rigorous\r\nnumerical experiments, we look at oblique incidence of semi-guided
plane waves. Radiation losses\r\nvanish beyond a certain critical angle of incidence.
One can thus realize lossless propagation through\r\n90-degree corner configurations,
where the remaining guided waves are still subject to pronounced\r\nreflection
and polarization conversion. A system of two corners can be viewed as a structure
akin to\r\na Fabry-Perot-interferometer. By adjusting the distance between the
two partial reflectors, here the\r\n90-degree corners, one identifies step-like
configurations that transmit the semi-guided plane waves\r\nwithout radiation
losses, and virtually without reflections. Simulations of semi-guided beams with\r\nin-plane
wide Gaussian profiles show that the effect survives in a true 3-D framework."
article_type: original
author:
- first_name: Manfred
full_name: Hammer, Manfred
id: '48077'
last_name: Hammer
orcid: 0000-0002-6331-9348
- first_name: Andre
full_name: Hildebrandt, Andre
last_name: Hildebrandt
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
citation:
ama: Hammer M, Hildebrandt A, Förstner J. Full Resonant Transmission of Semiguided
Planar Waves Through Slab Waveguide Steps at Oblique Incidence. Journal of
Lightwave Technology. 2015;34(3):997-1005. doi:10.1109/jlt.2015.2502431
apa: Hammer, M., Hildebrandt, A., & Förstner, J. (2015). Full Resonant Transmission
of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence.
Journal of Lightwave Technology, 34(3), 997–1005. https://doi.org/10.1109/jlt.2015.2502431
bibtex: '@article{Hammer_Hildebrandt_Förstner_2015, title={Full Resonant Transmission
of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence},
volume={34}, DOI={10.1109/jlt.2015.2502431},
number={3}, journal={Journal of Lightwave Technology}, publisher={Institute of
Electrical and Electronics Engineers (IEEE)}, author={Hammer, Manfred and Hildebrandt,
Andre and Förstner, Jens}, year={2015}, pages={997–1005} }'
chicago: 'Hammer, Manfred, Andre Hildebrandt, and Jens Förstner. “Full Resonant
Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique
Incidence.” Journal of Lightwave Technology 34, no. 3 (2015): 997–1005.
https://doi.org/10.1109/jlt.2015.2502431.'
ieee: M. Hammer, A. Hildebrandt, and J. Förstner, “Full Resonant Transmission of
Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence,” Journal
of Lightwave Technology, vol. 34, no. 3, pp. 997–1005, 2015.
mla: Hammer, Manfred, et al. “Full Resonant Transmission of Semiguided Planar Waves
Through Slab Waveguide Steps at Oblique Incidence.” Journal of Lightwave Technology,
vol. 34, no. 3, Institute of Electrical and Electronics Engineers (IEEE), 2015,
pp. 997–1005, doi:10.1109/jlt.2015.2502431.
short: M. Hammer, A. Hildebrandt, J. Förstner, Journal of Lightwave Technology 34
(2015) 997–1005.
date_created: 2018-08-08T10:34:34Z
date_updated: 2022-01-06T06:59:44Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1109/jlt.2015.2502431
file:
- access_level: local
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-08T10:37:19Z
date_updated: 2018-09-03T14:43:26Z
file_id: '3848'
file_name: 2016 Hammer,Hildebrandt,Förstner_Full resonant transmission of semi-guided
planar waves.pdf
file_size: 606723
relation: main_file
file_date_updated: 2018-09-03T14:43:26Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '3'
keyword:
- tet_topic_waveguide
language:
- iso: eng
page: 997-1005
publication: Journal of Lightwave Technology
publication_identifier:
issn:
- 0733-8724
- 1558-2213
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide
Steps at Oblique Incidence
type: journal_article
user_id: '158'
volume: 34
year: '2015'
...
---
_id: '3879'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: Wachsmuth H. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining.;
2015. doi:http://dx.doi.org/10.1007/978-3-319-25741-9
apa: Wachsmuth, H. (2015). Text Analysis Pipelines - Towards Ad-hoc Large-scale
Text Mining. http://dx.doi.org/10.1007/978-3-319-25741-9
bibtex: '@book{Wachsmuth_2015, series={Lecture Notes in Computer Science}, title={Text
Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining}, DOI={http://dx.doi.org/10.1007/978-3-319-25741-9},
author={Wachsmuth, Henning}, year={2015}, collection={Lecture Notes in Computer
Science} }'
chicago: Wachsmuth, Henning. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale
Text Mining. Lecture Notes in Computer Science, 2015. http://dx.doi.org/10.1007/978-3-319-25741-9.
ieee: H. Wachsmuth, Text Analysis Pipelines - Towards Ad-hoc Large-scale Text
Mining. 2015.
mla: Wachsmuth, Henning. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale
Text Mining. 2015, doi:http://dx.doi.org/10.1007/978-3-319-25741-9.
short: H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining,
2015.
date_created: 2018-08-11T16:15:08Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '600'
doi: http://dx.doi.org/10.1007/978-3-319-25741-9
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-319-25740-2
series_title: Lecture Notes in Computer Science
status: public
title: Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining
type: book
user_id: '82920'
year: '2015'
...
---
_id: '3892'
abstract:
- lang: eng
text: Plasmon modes of the exact same individual gold nanoprisms are investigated
through combined nanometer-resolved electron energy-loss spectroscopy (EELS) and
cathodoluminescence (CL) measurements. We show that CL only probes the radiative
modes, in contrast to EELS, which additionally reveals dark modes. The combination
of both techniques on the same particles thus provides complementary information
and also demonstrates that although the radiative modes give rise to very similar
spatial distributions when probed by EELS or CL, their resonant energies appear
to be different. We trace this phenomenon back to plasmon dissipation, which affects
in different ways the plasmon signatures probed by these techniques. Our experiments
are in agreement with electromagnetic numerical simulations and can be further
interpreted within the framework of a quasistatic analytical model. We therefore
demonstrate that CL and EELS are closely related to optical scattering and extinction,
respectively, with the addition of nanometer spatial resolution.
article_type: original
author:
- first_name: Arthur
full_name: Losquin, Arthur
last_name: Losquin
- first_name: Luiz F.
full_name: Zagonel, Luiz F.
last_name: Zagonel
- first_name: Viktor
full_name: Myroshnychenko, Viktor
id: '46371'
last_name: Myroshnychenko
- first_name: Benito
full_name: Rodríguez-González, Benito
last_name: Rodríguez-González
- first_name: Marcel
full_name: Tencé, Marcel
last_name: Tencé
- first_name: Leonardo
full_name: Scarabelli, Leonardo
last_name: Scarabelli
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Luis M.
full_name: Liz-Marzán, Luis M.
last_name: Liz-Marzán
- first_name: F. Javier
full_name: García de Abajo, F. Javier
last_name: García de Abajo
- first_name: Odile
full_name: Stéphan, Odile
last_name: Stéphan
- first_name: Mathieu
full_name: Kociak, Mathieu
last_name: Kociak
citation:
ama: Losquin A, Zagonel LF, Myroshnychenko V, et al. Unveiling Nanometer Scale Extinction
and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and
Cathodoluminescence Measurements. Nano Letters. 2015;15(2):1229-1237. doi:10.1021/nl5043775
apa: Losquin, A., Zagonel, L. F., Myroshnychenko, V., Rodríguez-González, B., Tencé,
M., Scarabelli, L., … Kociak, M. (2015). Unveiling Nanometer Scale Extinction
and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and
Cathodoluminescence Measurements. Nano Letters, 15(2), 1229–1237.
https://doi.org/10.1021/nl5043775
bibtex: '@article{Losquin_Zagonel_Myroshnychenko_Rodríguez-González_Tencé_Scarabelli_Förstner_Liz-Marzán_García
de Abajo_Stéphan_et al._2015, title={Unveiling Nanometer Scale Extinction and
Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence
Measurements}, volume={15}, DOI={10.1021/nl5043775},
number={2}, journal={Nano Letters}, publisher={American Chemical Society (ACS)},
author={Losquin, Arthur and Zagonel, Luiz F. and Myroshnychenko, Viktor and Rodríguez-González,
Benito and Tencé, Marcel and Scarabelli, Leonardo and Förstner, Jens and Liz-Marzán,
Luis M. and García de Abajo, F. Javier and Stéphan, Odile and et al.}, year={2015},
pages={1229–1237} }'
chicago: 'Losquin, Arthur, Luiz F. Zagonel, Viktor Myroshnychenko, Benito Rodríguez-González,
Marcel Tencé, Leonardo Scarabelli, Jens Förstner, et al. “Unveiling Nanometer
Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss
Spectroscopy and Cathodoluminescence Measurements.” Nano Letters 15, no.
2 (2015): 1229–37. https://doi.org/10.1021/nl5043775.'
ieee: A. Losquin et al., “Unveiling Nanometer Scale Extinction and Scattering
Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence
Measurements,” Nano Letters, vol. 15, no. 2, pp. 1229–1237, 2015.
mla: Losquin, Arthur, et al. “Unveiling Nanometer Scale Extinction and Scattering
Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence
Measurements.” Nano Letters, vol. 15, no. 2, American Chemical Society
(ACS), 2015, pp. 1229–37, doi:10.1021/nl5043775.
short: A. Losquin, L.F. Zagonel, V. Myroshnychenko, B. Rodríguez-González, M. Tencé,
L. Scarabelli, J. Förstner, L.M. Liz-Marzán, F.J. García de Abajo, O. Stéphan,
M. Kociak, Nano Letters 15 (2015) 1229–1237.
date_created: 2018-08-13T09:32:56Z
date_updated: 2022-01-06T06:59:50Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1021/nl5043775
file:
- access_level: open_access
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-13T09:35:36Z
date_updated: 2018-09-04T20:06:07Z
file_id: '3893'
file_name: 2015-01 Losquin et al_Unveiling Nanometer Scale Extinction and Scattering
Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence
MeasurementsNanoletters_EELS and CL .pdf
file_size: 521343
relation: main_file
file_date_updated: 2018-09-04T20:06:07Z
has_accepted_license: '1'
intvolume: ' 15'
issue: '2'
keyword:
- tet_topic_plasmonics
language:
- iso: eng
oa: '1'
page: 1229-1237
publication: Nano Letters
publication_identifier:
issn:
- 1530-6984
- 1530-6992
publication_status: published
publisher: American Chemical Society (ACS)
status: public
title: Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined
Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements
type: journal_article
urn: '38927'
user_id: '158'
volume: 15
year: '2015'
...
---
_id: '3894'
abstract:
- lang: eng
text: "We show how to optically connect guiding layers at different elevations in
a 3-D integrated photonic circuit. Transfer of\r\noptical power carried by planar,
semi-guided waves is possible without reflections or radiation losses, and over
large\r\nvertical distances. This functionality is realized through simple step-like
folds of high-contrast dielectric slab waveguides, in combination with oblique
wave incidence, and fulfilling a resonance condition. Radiation losses vanish,
and polarization conversion is suppressed for TE wave incidence beyond certain
critical angles. This can be understood by fundamental arguments resting on a
version of Snell’s law. The two 90° corners of a step act as identical partial
reflectors in a Fabry–Perot-like resonator setup. By selecting the step height,
i.e., the distance between the reflectors, one realizes resonant states with full
transmission. Rigorous quasi-analytical simulations\r\nfor typical silicon/silica
parameters demonstrate the functioning. Combinations of several step junctions
can lead\r\nto other types of optical on-chip connects, e.g., U-turn- or bridge-like
configurations."
article_type: original
author:
- first_name: Manfred
full_name: Hammer, Manfred
id: '48077'
last_name: Hammer
orcid: 0000-0002-6331-9348
- first_name: Andre
full_name: Hildebrandt, Andre
last_name: Hildebrandt
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
citation:
ama: Hammer M, Hildebrandt A, Förstner J. How planar optical waves can be made to
climb dielectric steps. Optics Letters. 2015;40(16):3711-3714. doi:10.1364/ol.40.003711
apa: Hammer, M., Hildebrandt, A., & Förstner, J. (2015). How planar optical
waves can be made to climb dielectric steps. Optics Letters, 40(16),
3711–3714. https://doi.org/10.1364/ol.40.003711
bibtex: '@article{Hammer_Hildebrandt_Förstner_2015, title={How planar optical waves
can be made to climb dielectric steps}, volume={40}, DOI={10.1364/ol.40.003711},
number={16}, journal={Optics Letters}, publisher={The Optical Society}, author={Hammer,
Manfred and Hildebrandt, Andre and Förstner, Jens}, year={2015}, pages={3711–3714}
}'
chicago: 'Hammer, Manfred, Andre Hildebrandt, and Jens Förstner. “How Planar Optical
Waves Can Be Made to Climb Dielectric Steps.” Optics Letters 40, no. 16
(2015): 3711–14. https://doi.org/10.1364/ol.40.003711.'
ieee: M. Hammer, A. Hildebrandt, and J. Förstner, “How planar optical waves can
be made to climb dielectric steps,” Optics Letters, vol. 40, no. 16, pp.
3711–3714, 2015.
mla: Hammer, Manfred, et al. “How Planar Optical Waves Can Be Made to Climb Dielectric
Steps.” Optics Letters, vol. 40, no. 16, The Optical Society, 2015, pp.
3711–14, doi:10.1364/ol.40.003711.
short: M. Hammer, A. Hildebrandt, J. Förstner, Optics Letters 40 (2015) 3711–3714.
date_created: 2018-08-13T09:39:06Z
date_updated: 2022-01-06T06:59:51Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1364/ol.40.003711
file:
- access_level: open_access
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-13T09:41:32Z
date_updated: 2018-09-04T19:35:48Z
file_id: '3895'
file_name: 2015-07 Hammer,Hildebrandt,Förstner_How planar optical waves can be made
to climb dielectric steps_Optics Letter.pdf
file_size: 1504149
relation: main_file
file_date_updated: 2018-09-04T19:35:48Z
has_accepted_license: '1'
intvolume: ' 40'
issue: '16'
keyword:
- tet_topic_waveguide
language:
- iso: eng
oa: '1'
page: 3711-3714
publication: Optics Letters
publication_identifier:
issn:
- 0146-9592
- 1539-4794
publication_status: published
publisher: The Optical Society
status: public
title: How planar optical waves can be made to climb dielectric steps
type: journal_article
urn: '38942'
user_id: '158'
volume: 40
year: '2015'
...
---
_id: '3896'
abstract:
- lang: eng
text: We study the formation of subwavelength solitons in binary metal-dielectric
lattices. We show that the transverse modulation of the lattice constant breaks
the fundamental plasmonic band and suppresses the discrete diffraction of surface
plasmon waves. New types of plasmonic solitons are found, and their characteristics
are analyzed. We also demonstrate the existence of photonic-plasmonic vector solitons
and elucidate their propagation properties.
article_type: original
author:
- first_name: Yao
full_name: Kou, Yao
last_name: Kou
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
citation:
ama: Kou Y, Förstner J. Subwavelength binary plasmonic solitons. Optics Letters.
2015;40(6):851-854. doi:10.1364/ol.40.000851
apa: Kou, Y., & Förstner, J. (2015). Subwavelength binary plasmonic solitons.
Optics Letters, 40(6), 851–854. https://doi.org/10.1364/ol.40.000851
bibtex: '@article{Kou_Förstner_2015, title={Subwavelength binary plasmonic solitons},
volume={40}, DOI={10.1364/ol.40.000851},
number={6}, journal={Optics Letters}, publisher={The Optical Society}, author={Kou,
Yao and Förstner, Jens}, year={2015}, pages={851–854} }'
chicago: 'Kou, Yao, and Jens Förstner. “Subwavelength Binary Plasmonic Solitons.”
Optics Letters 40, no. 6 (2015): 851–54. https://doi.org/10.1364/ol.40.000851.'
ieee: Y. Kou and J. Förstner, “Subwavelength binary plasmonic solitons,” Optics
Letters, vol. 40, no. 6, pp. 851–854, 2015.
mla: Kou, Yao, and Jens Förstner. “Subwavelength Binary Plasmonic Solitons.” Optics
Letters, vol. 40, no. 6, The Optical Society, 2015, pp. 851–54, doi:10.1364/ol.40.000851.
short: Y. Kou, J. Förstner, Optics Letters 40 (2015) 851–854.
date_created: 2018-08-13T10:22:12Z
date_updated: 2022-01-06T06:59:52Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1364/ol.40.000851
file:
- access_level: open_access
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-13T10:23:50Z
date_updated: 2018-09-04T19:53:37Z
file_id: '3897'
file_name: 2015-03 Kou,Förstner_Subwavelength binary plasmonic solitons_Optics letters.pdf
file_size: 585088
relation: main_file
file_date_updated: 2018-09-04T19:53:37Z
has_accepted_license: '1'
intvolume: ' 40'
issue: '6'
keyword:
- tet_topic_polariton
language:
- iso: eng
oa: '1'
page: 851-854
publication: Optics Letters
publication_identifier:
issn:
- 0146-9592
- 1539-4794
publication_status: published
publisher: The Optical Society
status: public
title: Subwavelength binary plasmonic solitons
type: journal_article
urn: '38960'
user_id: '158'
volume: 40
year: '2015'
...
---
_id: '3900'
abstract:
- lang: eng
text: The coherent state preparation and control of single quantum systems is an
important prerequisite for the implementation of functional quantum devices. Prominent
examples for such systems are semiconductor quantum dots, which exhibit a fine
structure split single exciton state and a V-type three level structure, given
by a common ground state and two distinguishable and separately excitable transitions.
In this work we introduce a novel concept for the preparation of a robust inversion
by the sequential excitation in a V-type system via distinguishable paths.
article_type: original
author:
- first_name: D.
full_name: Mantei, D.
last_name: Mantei
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: S.
full_name: Gordon, S.
last_name: Gordon
- first_name: Y. A.
full_name: Leier, Y. A.
last_name: Leier
- first_name: A. K.
full_name: Rai, A. K.
last_name: Rai
- first_name: Dirk
full_name: Reuter, Dirk
id: '37763'
last_name: Reuter
- first_name: A. D.
full_name: Wieck, A. D.
last_name: Wieck
- first_name: Artur
full_name: Zrenner, Artur
id: '606'
last_name: Zrenner
orcid: 0000-0002-5190-0944
citation:
ama: Mantei D, Förstner J, Gordon S, et al. Robust Population Inversion by Polarization
Selective Pulsed Excitation. Scientific Reports. 2015;5(1):10313. doi:10.1038/srep10313
apa: Mantei, D., Förstner, J., Gordon, S., Leier, Y. A., Rai, A. K., Reuter, D.,
… Zrenner, A. (2015). Robust Population Inversion by Polarization Selective Pulsed
Excitation. Scientific Reports, 5(1), 10313. https://doi.org/10.1038/srep10313
bibtex: '@article{Mantei_Förstner_Gordon_Leier_Rai_Reuter_Wieck_Zrenner_2015, title={Robust
Population Inversion by Polarization Selective Pulsed Excitation}, volume={5},
DOI={10.1038/srep10313}, number={1},
journal={Scientific Reports}, publisher={Springer Nature}, author={Mantei, D.
and Förstner, Jens and Gordon, S. and Leier, Y. A. and Rai, A. K. and Reuter,
Dirk and Wieck, A. D. and Zrenner, Artur}, year={2015}, pages={10313} }'
chicago: 'Mantei, D., Jens Förstner, S. Gordon, Y. A. Leier, A. K. Rai, Dirk Reuter,
A. D. Wieck, and Artur Zrenner. “Robust Population Inversion by Polarization Selective
Pulsed Excitation.” Scientific Reports 5, no. 1 (2015): 10313. https://doi.org/10.1038/srep10313.'
ieee: D. Mantei et al., “Robust Population Inversion by Polarization Selective
Pulsed Excitation,” Scientific Reports, vol. 5, no. 1, p. 10313, 2015.
mla: Mantei, D., et al. “Robust Population Inversion by Polarization Selective Pulsed
Excitation.” Scientific Reports, vol. 5, no. 1, Springer Nature, 2015,
p. 10313, doi:10.1038/srep10313.
short: D. Mantei, J. Förstner, S. Gordon, Y.A. Leier, A.K. Rai, D. Reuter, A.D.
Wieck, A. Zrenner, Scientific Reports 5 (2015) 10313.
date_created: 2018-08-13T10:34:17Z
date_updated: 2022-01-06T06:59:53Z
ddc:
- '530'
department:
- _id: '61'
- _id: '15'
- _id: '292'
- _id: '290'
doi: 10.1038/srep10313
file:
- access_level: open_access
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-13T10:39:14Z
date_updated: 2018-08-21T11:37:12Z
file_id: '3901'
file_name: 2015-05 Mantei,Förstner,Gordon,Leier,Rai,Reuter,Wieck,Zrenner_Robust
Population Inversion by Polarization Selective Pulsed Excitation.pdf
file_size: 1089911
relation: main_file
file_date_updated: 2018-08-21T11:37:12Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '1'
keyword:
- tet_topic_qd
language:
- iso: eng
oa: '1'
page: '10313'
publication: Scientific Reports
publication_identifier:
issn:
- 2045-2322
publication_status: published
publisher: Springer Nature
status: public
title: Robust Population Inversion by Polarization Selective Pulsed Excitation
type: journal_article
urn: '39004'
user_id: '55706'
volume: 5
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: '2921'
author:
- first_name: Olivier
full_name: Blazy, Olivier
last_name: Blazy
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Jiaxin
full_name: Pan, Jiaxin
last_name: Pan
citation:
ama: 'Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon
Hash Functions. In: Lecture Notes in Computer Science. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2015:256-279. doi:10.1007/978-3-662-46447-2_12'
apa: 'Blazy, O., Kakvi, S., Kiltz, E., & Pan, J. (2015). Tightly-Secure Signatures
from Chameleon Hash Functions. In Lecture Notes in Computer Science (pp.
256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-46447-2_12'
bibtex: '@inbook{Blazy_Kakvi_Kiltz_Pan_2015, place={Berlin, Heidelberg}, title={Tightly-Secure
Signatures from Chameleon Hash Functions}, DOI={10.1007/978-3-662-46447-2_12},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin}, year={2015},
pages={256–279} }'
chicago: 'Blazy, Olivier, Saqib Kakvi, Eike Kiltz, and Jiaxin Pan. “Tightly-Secure
Signatures from Chameleon Hash Functions.” In Lecture Notes in Computer Science,
256–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. https://doi.org/10.1007/978-3-662-46447-2_12.'
ieee: 'O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from
Chameleon Hash Functions,” in Lecture Notes in Computer Science, Berlin,
Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.'
mla: Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.”
Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2015, pp.
256–79, doi:10.1007/978-3-662-46447-2_12.
short: 'O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.'
date_created: 2018-05-25T12:46:08Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-662-46447-2_12
extern: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/1021.pdf
oa: '1'
page: 256-279
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783662464465'
- '9783662464472'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Tightly-Secure Signatures from Chameleon Hash Functions
type: book_chapter
user_id: '66268'
year: '2015'
...