---
_id: '28321'
abstract:
- lang: eng
text: Der Lebenszyklus von Produktionssystemen besteht nach Wiendahl et al. aus
den drei Phasen Planung und Realisierung, Betrieb und Redistribution (Wiendahl
et al. in Anlaufrobuste Produktionssysteme. Werkstattstechnik (wt) online, Jahrg.
92, Ausgabe 11/12, 2002, S. 650-655). Jede Phase enthält vielfältige Aufgaben
die maßgeblich vom Fach- und Erfahrungswissen der Mitarbeiter abhängen. In der
ersten Phase werden unter anderem die Fertigungsprozesse und -ressourcen festgelegt.
Hierfür bedarf es genauer Kenntnisse über die zu fertigenden Bauteile, benötigten
Prozesse und geeigneten Ressourcen selbst sowie deren Abhängigkeiten untereinander.
In der Betriebsphase des Produktionssystems muss auf Maschinenausfälle oder Eilaufträge
mit Um- bzw. Neuplanungen von Ressourcen reagiert werden. Das benötigte Wissen
im Lebenszyklus von Produktionssystemen verteilt sich in der Regel auf verschiedene
Personen und eine Vielzahl unterschiedlicher Dokumente; teilweise ist es auch
nur implizit vorhanden. Demzufolge liegt es verteilt und unstrukturiert vor und
eignet sich nicht für eine bedarfsgerechte Bereitstellung. Darüber hinaus fehlt
eine Semantik, die das vorhandene Wissen in Beziehung setzt und durch automatisierte
Schlussfolgerungen ergänzt. Hierfür bieten wissensbasierte Systeme (WBS) auf Basis
von Ontologien einen vielversprechenden Lösungsansatz. Diese bieten eine Semantik
und Inferenz zur Wissensmodellierung und ermöglichen den effizienten Zugriff auf
das benötigte Wissen. Dies verspricht eine große Zeitersparnis bei den Aufgaben
im Lebenszyklus von Produktionssystemen, auch im Hinblick auf die immer kürzer
werdenden Produktlebenszyklen. Der Beitrag beschreibt den Aufbau von drei Ontologien
für das Wissensmanagement im Rahmen verschiedener Aufgaben. Ferner werden die
Vorteile durch den Einsatz von Ontologien praxisorientiert anhand eines Produktionssystems
für eine Taschenlampe dargestellt.
author:
- first_name: Marcus
full_name: Petersen, Marcus
last_name: Petersen
- first_name: Gerald
full_name: Rehage, Gerald
last_name: Rehage
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Frank
full_name: Bauer, Frank
last_name: Bauer
citation:
ama: 'Petersen M, Rehage G, Gausemeier J, Bauer F. Wissensaufbereitung und -bereitstellung
durch Ontologien im Lebenszyklus von Produktionssystemen. In: Gausemeier J, Dumitrescu
R, Rammig F-J, Schäfer W, Trächtler A, eds. Wissenschafts- und Industrieforum
2015 Intelligente Technische Systeme - 10. Paderborner Workshop Entwurf mechatronischer
Systeme, Nr. 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:189-209.'
apa: Petersen, M., Rehage, G., Gausemeier, J., & Bauer, F. (2015). Wissensaufbereitung
und -bereitstellung durch Ontologien im Lebenszyklus von Produktionssystemen.
In J. Gausemeier, R. Dumitrescu, F.-J. Rammig, W. Schäfer, & A. Trächtler
(Eds.), Wissenschafts- und Industrieforum 2015 Intelligente Technische Systeme
- 10. Paderborner Workshop Entwurf mechatronischer Systeme, Nr. 343 (pp. 189–209).
Verlagsschriftenreihe des Heinz Nixdorf Instituts.
bibtex: '@inproceedings{Petersen_Rehage_Gausemeier_Bauer_2015, place={Paderborn},
title={Wissensaufbereitung und -bereitstellung durch Ontologien im Lebenszyklus
von Produktionssystemen}, booktitle={Wissenschafts- und Industrieforum 2015 Intelligente
Technische Systeme - 10. Paderborner Workshop Entwurf mechatronischer Systeme,
Nr. 343}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Petersen,
Marcus and Rehage, Gerald and Gausemeier, Jürgen and Bauer, Frank}, editor={Gausemeier,
Jürgen and Dumitrescu, Roman and Rammig, Franz-Josef and Schäfer, Wilhelm and
Trächtler, Ansgar}, year={2015}, pages={189–209} }'
chicago: 'Petersen, Marcus, Gerald Rehage, Jürgen Gausemeier, and Frank Bauer. “Wissensaufbereitung
und -bereitstellung durch Ontologien im Lebenszyklus von Produktionssystemen.”
In Wissenschafts- und Industrieforum 2015 Intelligente Technische Systeme -
10. Paderborner Workshop Entwurf mechatronischer Systeme, Nr. 343, edited
by Jürgen Gausemeier, Roman Dumitrescu, Franz-Josef Rammig, Wilhelm Schäfer, and
Ansgar Trächtler, 189–209. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
Instituts, 2015.'
ieee: M. Petersen, G. Rehage, J. Gausemeier, and F. Bauer, “Wissensaufbereitung
und -bereitstellung durch Ontologien im Lebenszyklus von Produktionssystemen,”
in Wissenschafts- und Industrieforum 2015 Intelligente Technische Systeme -
10. Paderborner Workshop Entwurf mechatronischer Systeme, Nr. 343, 2015, pp.
189–209.
mla: Petersen, Marcus, et al. “Wissensaufbereitung und -bereitstellung durch Ontologien
im Lebenszyklus von Produktionssystemen.” Wissenschafts- und Industrieforum
2015 Intelligente Technische Systeme - 10. Paderborner Workshop Entwurf mechatronischer
Systeme, Nr. 343, edited by Jürgen Gausemeier et al., Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015, pp. 189–209.
short: 'M. Petersen, G. Rehage, J. Gausemeier, F. Bauer, in: J. Gausemeier, R. Dumitrescu,
F.-J. Rammig, W. Schäfer, A. Trächtler (Eds.), Wissenschafts- und Industrieforum
2015 Intelligente Technische Systeme - 10. Paderborner Workshop Entwurf mechatronischer
Systeme, Nr. 343, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2015, pp. 189–209.'
date_created: 2021-12-06T10:08:04Z
date_updated: 2022-01-06T06:58:01Z
department:
- _id: '676'
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Ansgar
full_name: Trächtler, Ansgar
last_name: Trächtler
language:
- iso: ger
page: 189-209
place: Paderborn
publication: Wissenschafts- und Industrieforum 2015 Intelligente Technische Systeme
- 10. Paderborner Workshop Entwurf mechatronischer Systeme, Nr. 343
publication_identifier:
isbn:
- 978-3-942647-62-5
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Wissensaufbereitung und -bereitstellung durch Ontologien im Lebenszyklus von
Produktionssystemen
type: conference
user_id: '21240'
year: '2015'
...
---
_id: '28360'
abstract:
- lang: ger
text: "Dieser Beitrag untersucht den Einfluss der Aussprache auf die Selbstkonstruktion
von Lernenden und deren Bereitschaft, sich auf die zu erlernende Sprache und Kultur
einzulassen. Im Gegensatz zu traditionellen Forschungsansätzen wird die Aussprache
dabei als subjektiv bedeutsame Dimension im Sprachlernprozess konzipiert, die
die Wahrnehmungen der Lernenden gegenüber sich selbst, anderen Sprechenden und
dem gesamten Lernkontext stark mitprägt. Die Untersuchungen basieren auf den Narrationen
zweier kanadischer Germanistikstudierender, die zwei Semester an deutschen Universitäten
verbrachten. Der Selbstfindungs- und Lernprozess beider Studierender im fremden
Umfeld wird dabei wesentlich durch ihre Selbstwahrnehmungen gelenkt, welche wiederum
stark um das Thema Aussprache kreisen. Obwohl sich beide Lernende sehr unterschiedlich
als Sprechende des Deutschen konstruieren,\r\nfixieren sie sich darauf, wie sie
meinen zu klingen und folglich wahrgenommen zu werden. Dabei erweist sich vor
allem das Konstrukt des Native Speaker als zentraler Vergleichspunkt, an dem sich
die Lernenden messen und der somit als Basis für die Wertung des Auslandsaufenthalts
und des eigenen Lernerfolgs dient. Durch die Analyse subjektiver Lernertheorien
entwirft dieser Beitrag einen gänzlich neuen Rahmen für die Betrachtung von Aussprache
im Sprachlernprozess, der über die rein phonetische Dimension hinausgeht und den
Fokus auf die sozialpsychologischen Funktionen von Aussprache lenkt."
author:
- first_name: Mareike
full_name: Müller, Mareike
id: '71540'
last_name: Müller
- first_name: Barbara
full_name: Schmenk, Barbara
last_name: Schmenk
citation:
ama: 'Müller M, Schmenk B. Der Klang meines Selbst: Aussprache und Selbstkonstruktion
von Fremdsprachenlernenden. In: Böcker J, Stauch A, eds. Konzepte aus der
Sprachlehrforschung – Impulse für die Praxis: Festschrift für Karin Kleppin.
Peter Lang; 2015:171-188.'
apa: 'Müller, M., & Schmenk, B. (2015). Der Klang meines Selbst: Aussprache
und Selbstkonstruktion von Fremdsprachenlernenden. In J. Böcker & A. Stauch
(Eds.), Konzepte aus der Sprachlehrforschung – Impulse für die Praxis: Festschrift
für Karin Kleppin (pp. 171–188). Peter Lang.'
bibtex: '@inbook{Müller_Schmenk_2015, place={Frankfurt/Main}, title={Der Klang meines
Selbst: Aussprache und Selbstkonstruktion von Fremdsprachenlernenden}, booktitle={Konzepte
aus der Sprachlehrforschung – Impulse für die Praxis: Festschrift für Karin Kleppin},
publisher={Peter Lang}, author={Müller, Mareike and Schmenk, Barbara}, editor={Böcker
, Jessica and Stauch, Annette}, year={2015}, pages={171–188} }'
chicago: 'Müller, Mareike, and Barbara Schmenk. “Der Klang meines Selbst: Aussprache
und Selbstkonstruktion von Fremdsprachenlernenden.” In Konzepte aus der Sprachlehrforschung
– Impulse für die Praxis: Festschrift für Karin Kleppin, edited by Jessica Böcker and
Annette Stauch, 171–88. Frankfurt/Main: Peter Lang, 2015.'
ieee: 'M. Müller and B. Schmenk, “Der Klang meines Selbst: Aussprache und Selbstkonstruktion
von Fremdsprachenlernenden,” in Konzepte aus der Sprachlehrforschung – Impulse
für die Praxis: Festschrift für Karin Kleppin, J. Böcker and A. Stauch, Eds.
Frankfurt/Main: Peter Lang, 2015, pp. 171–188.'
mla: 'Müller, Mareike, and Barbara Schmenk. “Der Klang meines Selbst: Aussprache
und Selbstkonstruktion von Fremdsprachenlernenden.” Konzepte aus der Sprachlehrforschung
– Impulse für die Praxis: Festschrift für Karin Kleppin, edited by Jessica Böcker and
Annette Stauch, Peter Lang, 2015, pp. 171–88.'
short: 'M. Müller, B. Schmenk, in: J. Böcker , A. Stauch (Eds.), Konzepte aus der
Sprachlehrforschung – Impulse für die Praxis: Festschrift für Karin Kleppin, Peter
Lang, Frankfurt/Main, 2015, pp. 171–188.'
date_created: 2021-12-07T13:22:41Z
date_updated: 2022-01-06T06:58:02Z
department:
- _id: '468'
editor:
- first_name: 'Jessica '
full_name: 'Böcker , Jessica '
last_name: 'Böcker '
- first_name: Annette
full_name: Stauch, Annette
last_name: Stauch
extern: '1'
language:
- iso: ger
page: 171-188
place: Frankfurt/Main
publication: 'Konzepte aus der Sprachlehrforschung – Impulse für die Praxis: Festschrift
für Karin Kleppin'
publication_identifier:
isbn:
- ' 9783631647189'
publication_status: published
publisher: Peter Lang
status: public
title: 'Der Klang meines Selbst: Aussprache und Selbstkonstruktion von Fremdsprachenlernenden'
type: book_chapter
user_id: '71540'
year: '2015'
...
---
_id: '241'
abstract:
- lang: eng
text: Distributed applications are commonly based on overlay networks interconnecting
their sites so that they can exchange information. For these overlay networks
to preserve their functionality, they should be able to recover from various problems
like membership changes or faults. Various self-stabilizing overlay networks have
already been proposed in recent years, which have the advantage of being able
to recover from any illegal state, but none of these networks can give any guarantees
on its functionality while the recovery process is going on. We initiate research
on overlay networks that are not only self-stabilizing but that also ensure that
searchability is maintained while the recovery process is going on, as long as
there are no corrupted messages in the system. More precisely, once a search message
from node u to another node v is successfully delivered, all future search messages
from u to v succeed as well. We call this property monotonic searchability. We
show that in general it is impossible to provide monotonic searchability if corrupted
messages are present in the system, which justifies the restriction to system
states without corrupted messages. Furthermore, we provide a self-stabilizing
protocol for the line for which we can also show monotonic searchability. It turns
out that even for the line it is non-trivial to achieve this property. Additionally,
we extend our protocol to deal with node departures in terms of the Finite Departure
Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of
handling node dynamics.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures. In: Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS). Leibniz International
Proceedings in Informatics (LIPIcs). ; 2015. doi:10.4230/LIPIcs.OPODIS.2015.24'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2015). Towards Establishing
Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings
of the 19th International Conference on Principles of Distributed Systems (OPODIS).
https://doi.org/10.4230/LIPIcs.OPODIS.2015.24
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International
Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures}, DOI={10.4230/LIPIcs.OPODIS.2015.24},
booktitle={Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann,
Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in
Informatics (LIPIcs)} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”
In Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS). Leibniz International Proceedings in Informatics (LIPIcs),
2015. https://doi.org/10.4230/LIPIcs.OPODIS.2015.24.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic
Searchability in Self-Stabilizing Data Structures,” in Proceedings of the 19th
International Conference on Principles of Distributed Systems (OPODIS), 2015.
mla: Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures.” Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS), 2015.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:07Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2015.24
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:28:21Z
date_updated: 2018-03-21T10:28:21Z
file_id: '1497'
file_name: 241-ScheidelerSetzerStrothmann2015.pdf
file_size: 692363
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:28:21Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
type: conference
user_id: '477'
year: '2015'
...
---
_id: '242'
abstract:
- lang: eng
text: 'A fundamental problem for overlay networks is to safely exclude leaving nodes,
i.e., the nodes requesting to leave the overlay network are excluded from it without
affecting its connectivity. There are a number of studies for safe node exclusion
if the overlay is in a well-defined state, but almost no formal results are known
for the case in which the overlay network is in an arbitrary initial state, i.e.,
when looking for a self-stabilizing solution for excluding leaving nodes. We study
this problem in two variants: the Finite Departure Problem (FDP) and the Finite
Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
it is safe to leave the network, whereas in the FSP, this leaving decision does
not have to be final: the nodes may resume computation when woken up by an incoming
message. We are the first to present a self-stabilizing protocol for the FDP and
the FSP that can be combined with a large class of overlay maintenance protocols
so that these are then guaranteed to safely exclude leaving nodes from the system
from any initial state while operating as specified for the staying nodes. In
order to formally define the properties these overlay maintenance protocols have
to satisfy, we identify four basic primitives for manipulating edges in an overlay
network that might be of independent interest.'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach
for the Finite Departure Problem in Overlay Networks. In: Proceedings of the
17th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS). Lecture Notes in Computer Science. ; 2015:201-216. doi:10.1007/978-3-319-21741-3_14'
apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Towards a
Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings
of the 17th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS) (pp. 201–216). https://doi.org/10.1007/978-3-319-21741-3_14
bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture
Notes in Computer Science}, title={Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks}, DOI={10.1007/978-3-319-21741-3_14},
booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and
Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216},
collection={Lecture Notes in Computer Science} }'
chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
In Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 201–16. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-319-21741-3_14.
ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal
Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings
of the 17th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2015, pp. 201–216.
mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks.” Proceedings of the 17th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.
short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the
17th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 2015, pp. 201–216.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:10Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-21741-3_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:59:32Z
date_updated: 2018-03-21T09:59:32Z
file_id: '1496'
file_name: 242-KSS-SSS2015.pdf
file_size: 532792
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:59:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 201-216
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
type: conference
user_id: '477'
year: '2015'
...
---
_id: '243'
abstract:
- lang: eng
text: This paper introduces the problem of communication pattern adaption for a
distributed self-adjusting binary search tree. We propose a simple local algorithm,
which is closely related to the nearly thirty-year-old idea of splay trees and
evaluate its adaption performance in the distributed scenario if different communication
patterns are provided.To do so, the process of self-adjustment is modeled similarly
to a basic network creation game, in which the nodes want to communicate with
only a certain subset of all nodes. We show that, in general, the game (i.e.,
the process of local adjustments) does not converge, and convergence is related
to certain structures of the communication interests, which we call conflicts.We
classify conflicts and show that for two communication scenarios in which convergence
is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate
the different classes of conflicts separately and show that, for a certain class
of conflicts, the performance of the tree network is asymptotically as good as
the performance for converging instances. However, for the other conflict classes,
a distributed self-adjusting binary search tree adapts poorly.
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Strothmann TF. The impact of communication patterns on distributed locally
self-adjusting binary search trees. In: Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM). LNCS. ; 2015:175--186. doi:10.1007/978-3-319-15612-5_16'
apa: Strothmann, T. F. (2015). The impact of communication patterns on distributed
locally self-adjusting binary search trees. In Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM) (pp. 175--186). https://doi.org/10.1007/978-3-319-15612-5_16
bibtex: '@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication
patterns on distributed locally self-adjusting binary search trees}, DOI={10.1007/978-3-319-15612-5_16},
booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation
(WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186},
collection={LNCS} }'
chicago: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Locally Self-Adjusting Binary Search Trees.” In Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 175--186. LNCS, 2015. https://doi.org/10.1007/978-3-319-15612-5_16.
ieee: T. F. Strothmann, “The impact of communication patterns on distributed locally
self-adjusting binary search trees,” in Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.
mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Locally Self-Adjusting Binary Search Trees.” Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186, doi:10.1007/978-3-319-15612-5_16.
short: 'T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms
and Computation (WALCOM), 2015, pp. 175--186.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-15612-5_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:59:00Z
date_updated: 2018-03-21T09:59:00Z
file_id: '1495'
file_name: 243-Strothmann-Walcom2015.pdf
file_size: 1003113
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:59:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--186
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 9th International Workshop on Algorithms and Computation
(WALCOM)
series_title: LNCS
status: public
title: The impact of communication patterns on distributed locally self-adjusting
binary search trees
type: conference
user_id: '477'
year: '2015'
...
---
_id: '26434'
author:
- first_name: Christina
full_name: Unger, Christina
last_name: Unger
- first_name: Corina
full_name: Forascu, Corina
last_name: Forascu
- first_name: Vanessa
full_name: López, Vanessa
last_name: López
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Elena
full_name: Cabrio, Elena
last_name: Cabrio
- first_name: Philipp
full_name: Cimiano, Philipp
last_name: Cimiano
- first_name: Sebastian
full_name: Walter, Sebastian
last_name: Walter
citation:
ama: 'Unger C, Forascu C, López V, et al. Question Answering over Linked Data (QALD-5).
In: Cappellato L, Ferro N, J. F. Jones G, SanJuan E, eds. Working Notes of
{CLEF} 2015 - Conference and Labs of the Evaluation Forum, Toulouse, France, September
8-11, 2015. Vol 1391. {CEUR} Workshop Proceedings. CEUR-WS.org; 2015.'
apa: Unger, C., Forascu, C., López, V., Ngonga Ngomo, A.-C., Cabrio, E., Cimiano,
P., & Walter, S. (2015). Question Answering over Linked Data (QALD-5). In
L. Cappellato, N. Ferro, G. J. F. Jones, & E. SanJuan (Eds.), Working Notes
of {CLEF} 2015 - Conference and Labs of the Evaluation forum, Toulouse, France,
September 8-11, 2015 (Vol. 1391). CEUR-WS.org.
bibtex: '@inproceedings{Unger_Forascu_López_Ngonga Ngomo_Cabrio_Cimiano_Walter_2015,
series={{CEUR} Workshop Proceedings}, title={Question Answering over Linked Data
(QALD-5)}, volume={1391}, booktitle={Working Notes of {CLEF} 2015 - Conference
and Labs of the Evaluation forum, Toulouse, France, September 8-11, 2015}, publisher={CEUR-WS.org},
author={Unger, Christina and Forascu, Corina and López, Vanessa and Ngonga Ngomo,
Axel-Cyrille and Cabrio, Elena and Cimiano, Philipp and Walter, Sebastian}, editor={Cappellato,
Linda and Ferro, Nicola and J. F. Jones, Gareth and SanJuan, Eric}, year={2015},
collection={{CEUR} Workshop Proceedings} }'
chicago: Unger, Christina, Corina Forascu, Vanessa López, Axel-Cyrille Ngonga Ngomo,
Elena Cabrio, Philipp Cimiano, and Sebastian Walter. “Question Answering over
Linked Data (QALD-5).” In Working Notes of {CLEF} 2015 - Conference and Labs
of the Evaluation Forum, Toulouse, France, September 8-11, 2015, edited by
Linda Cappellato, Nicola Ferro, Gareth J. F. Jones, and Eric SanJuan, Vol. 1391.
{CEUR} Workshop Proceedings. CEUR-WS.org, 2015.
ieee: C. Unger et al., “Question Answering over Linked Data (QALD-5),” in
Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation forum,
Toulouse, France, September 8-11, 2015, 2015, vol. 1391.
mla: Unger, Christina, et al. “Question Answering over Linked Data (QALD-5).” Working
Notes of {CLEF} 2015 - Conference and Labs of the Evaluation Forum, Toulouse,
France, September 8-11, 2015, edited by Linda Cappellato et al., vol. 1391,
CEUR-WS.org, 2015.
short: 'C. Unger, C. Forascu, V. López, A.-C. Ngonga Ngomo, E. Cabrio, P. Cimiano,
S. Walter, in: L. Cappellato, N. Ferro, G. J. F. Jones, E. SanJuan (Eds.), Working
Notes of {CLEF} 2015 - Conference and Labs of the Evaluation Forum, Toulouse,
France, September 8-11, 2015, CEUR-WS.org, 2015.'
date_created: 2021-10-18T20:33:35Z
date_updated: 2022-01-06T06:57:20Z
editor:
- first_name: Linda
full_name: Cappellato, Linda
last_name: Cappellato
- first_name: Nicola
full_name: Ferro, Nicola
last_name: Ferro
- first_name: Gareth
full_name: J. F. Jones, Gareth
last_name: J. F. Jones
- first_name: Eric
full_name: SanJuan, Eric
last_name: SanJuan
intvolume: ' 1391'
language:
- iso: eng
publication: Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation
forum, Toulouse, France, September 8-11, 2015
publisher: CEUR-WS.org
series_title: '{CEUR} Workshop Proceedings'
status: public
title: Question Answering over Linked Data (QALD-5)
type: conference
user_id: '15526'
volume: 1391
year: '2015'
...
---
_id: '266'
abstract:
- lang: eng
text: 'Many markets have seen a shift from the idea of buying and moved to leasing
instead. Arguably, the latter has been the major catalyst for their success. Ten
years ago, research realized this shift and initiated the study of "online leasing
problems" by introducing leasing to online optimization problems. Resources required
to provide a service in an "online leasing problem" are no more bought but leased
for different durations. In this paper, we provide an overview of results that
contribute to the understanding of "online resource leasing problems". '
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ;
2015:343-344. doi:10.1145/2767386.2767454'
apa: Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing.
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource
Leasing}, DOI={10.1145/2767386.2767454},
booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm},
year={2015}, pages={343–344} }'
chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource
Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454.
ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015,
pp. 343–344.
mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium
on Principles of Distributed Computing (PODC), 2015, pp. 343–344.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:22Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2767386.2767454
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:11Z
date_updated: 2018-03-21T09:33:11Z
file_id: '1478'
file_name: 266-p343-markarian.pdf
file_size: 679580
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:11Z
has_accepted_license: '1'
page: 343-344
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC)
status: public
title: Online Resource Leasing
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '26921'
abstract:
- lang: eng
text: 'AbstractThe growth hormone (GH) insulin-like
growth factor (IGF) axis has been linked to insulin metabolism and cancer risk.
Experimental evidence indicates that the GH–IGF axis itself can be influenced
by dietary flavonoids. As fruit and vegetable (FV) intake is a major source of
flavonoid consumption, FV’s beneficial health effects may be explained via flavonoids’
influence on the GH–IGF axis, but observational evidence is currently rare. We
used data from Dortmund Nutritional and Anthropometric Longitudinally Designed
Study participants to analyse prospective associations between FV, fruit intake
and flavonoid intake from FV (FlavFV) with IGF-1 and its binding proteins IGFBP-2
and IGFBP-3. Subjects needed to provide a fasting blood sample in adulthood (18–39
years) and at least two 3-d weighed dietary records in early life (0·5−2 years,n191),
mid-childhood (3−7 years,n265) or adolescence (girls:
9−15 years, boys: 10−16 years,n261). Additional analyses
were conducted among those providing at least three 24-h urine samples in adolescence
(n236) to address the predictor urinary hippuric acid
(HA), a biomarker of polyphenol intake. Higher fruit intake in mid-childhood and
adolescence was related to higher IGFBP-2 in adulthood (P=0·03
andP=0·045). Comparable trends (P=0·045−0·09)
were discernable for FV intake (but not FlavFV) in all three time windows. Similarly,
higher adolescent HA excretion tended to be related (P=0·06)
to higher adult IGFBP-2 levels. Regarding IGFBP-3, a marginal (P=0·08)
positive association was observed with FlavFV in mid-childhood only. None of the
investigated dietary factors was related to IGF-1. In conclusion, higher fruit
and FV intakes during growth may be relevant for adult IGFBP-2, but probably not
for IGFBP-3 or IGF-1.'
author:
- first_name: Danika
full_name: Krupp, Danika
last_name: Krupp
- first_name: Thomas
full_name: Remer, Thomas
last_name: Remer
- first_name: Katharina J.
full_name: Penczynski, Katharina J.
last_name: Penczynski
- first_name: Katja
full_name: Bolzenius, Katja
last_name: Bolzenius
- first_name: Stefan A.
full_name: Wudy, Stefan A.
last_name: Wudy
- first_name: Anette
full_name: Buyken, Anette
id: '65985'
last_name: Buyken
citation:
ama: Krupp D, Remer T, Penczynski KJ, Bolzenius K, Wudy SA, Buyken A. Relevance
of fruits, vegetables and flavonoids from fruits and vegetables during early life,
mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1)
and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood. British Journal
of Nutrition. Published online 2015:527-537. doi:10.1017/s0007114515004742
apa: Krupp, D., Remer, T., Penczynski, K. J., Bolzenius, K., Wudy, S. A., &
Buyken, A. (2015). Relevance of fruits, vegetables and flavonoids from fruits
and vegetables during early life, mid-childhood and adolescence for levels of
insulin-like growth factor (IGF-1) and its binding proteins IGFBP-2 and IGFBP-3
in young adulthood. British Journal of Nutrition, 527–537. https://doi.org/10.1017/s0007114515004742
bibtex: '@article{Krupp_Remer_Penczynski_Bolzenius_Wudy_Buyken_2015, title={Relevance
of fruits, vegetables and flavonoids from fruits and vegetables during early life,
mid-childhood and adolescence for levels of insulin-like growth factor (IGF-1)
and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood}, DOI={10.1017/s0007114515004742},
journal={British Journal of Nutrition}, author={Krupp, Danika and Remer, Thomas
and Penczynski, Katharina J. and Bolzenius, Katja and Wudy, Stefan A. and Buyken,
Anette}, year={2015}, pages={527–537} }'
chicago: Krupp, Danika, Thomas Remer, Katharina J. Penczynski, Katja Bolzenius,
Stefan A. Wudy, and Anette Buyken. “Relevance of Fruits, Vegetables and Flavonoids
from Fruits and Vegetables during Early Life, Mid-Childhood and Adolescence for
Levels of Insulin-like Growth Factor (IGF-1) and Its Binding Proteins IGFBP-2
and IGFBP-3 in Young Adulthood.” British Journal of Nutrition, 2015, 527–37.
https://doi.org/10.1017/s0007114515004742.
ieee: 'D. Krupp, T. Remer, K. J. Penczynski, K. Bolzenius, S. A. Wudy, and A. Buyken,
“Relevance of fruits, vegetables and flavonoids from fruits and vegetables during
early life, mid-childhood and adolescence for levels of insulin-like growth factor
(IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood,” British
Journal of Nutrition, pp. 527–537, 2015, doi: 10.1017/s0007114515004742.'
mla: Krupp, Danika, et al. “Relevance of Fruits, Vegetables and Flavonoids from
Fruits and Vegetables during Early Life, Mid-Childhood and Adolescence for Levels
of Insulin-like Growth Factor (IGF-1) and Its Binding Proteins IGFBP-2 and IGFBP-3
in Young Adulthood.” British Journal of Nutrition, 2015, pp. 527–37, doi:10.1017/s0007114515004742.
short: D. Krupp, T. Remer, K.J. Penczynski, K. Bolzenius, S.A. Wudy, A. Buyken,
British Journal of Nutrition (2015) 527–537.
date_created: 2021-10-26T14:31:53Z
date_updated: 2022-01-06T06:57:30Z
department:
- _id: '17'
- _id: '22'
- _id: '571'
doi: 10.1017/s0007114515004742
language:
- iso: eng
page: 527-537
publication: British Journal of Nutrition
publication_identifier:
issn:
- 0007-1145
- 1475-2662
publication_status: published
status: public
title: Relevance of fruits, vegetables and flavonoids from fruits and vegetables during
early life, mid-childhood and adolescence for levels of insulin-like growth factor
(IGF-1) and its binding proteins IGFBP-2 and IGFBP-3 in young adulthood
type: journal_article
user_id: '61597'
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: '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: '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: '304'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
citation:
ama: Koutsopoulos A. Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn; 2015.
apa: Koutsopoulos, A. (2015). Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn.
bibtex: '@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological
Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos,
Andreas}, year={2015} }'
chicago: Koutsopoulos, Andreas. Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn, 2015.
ieee: A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn, 2015.
mla: Koutsopoulos, Andreas. Dynamics and Efficiency in Topological Self-Stabilization.
Universität Paderborn, 2015.
short: A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:53Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:46:19Z
date_updated: 2018-03-20T07:46:19Z
file_id: '1441'
file_name: 304-Dissertation_-_Koutsopoulos.pdf
file_size: 2275834
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:46:19Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Dynamics and Efficiency in Topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...
---
_id: '305'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
citation:
ama: Kniesburges S. Distributed Data Structures and the Power of Topological
Self-Stabilization. Universität Paderborn; 2015.
apa: Kniesburges, S. (2015). Distributed Data Structures and the Power of topological
Self-Stabilization. Universität Paderborn.
bibtex: '@book{Kniesburges_2015, title={Distributed Data Structures and the Power
of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges,
Sebastian}, year={2015} }'
chicago: Kniesburges, Sebastian. Distributed Data Structures and the Power of
Topological Self-Stabilization. Universität Paderborn, 2015.
ieee: S. Kniesburges, Distributed Data Structures and the Power of topological
Self-Stabilization. Universität Paderborn, 2015.
mla: Kniesburges, Sebastian. Distributed Data Structures and the Power of Topological
Self-Stabilization. Universität Paderborn, 2015.
short: S. Kniesburges, Distributed Data Structures and the Power of Topological
Self-Stabilization, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-13T09:14:43Z
date_updated: 2018-03-13T09:14:43Z
file_id: '1206'
file_name: 305-Dissertation_-_Kniesburges.pdf
file_size: 1709094
relation: main_file
success: 1
file_date_updated: 2018-03-13T09:14:43Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Distributed Data Structures and the Power of topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...
---
_id: '270'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
citation:
ama: Abshoff S. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks.
Universität Paderborn; 2015.
apa: Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic
Ad-hoc Networks. Universität Paderborn.
bibtex: '@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in
Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff,
Sebastian}, year={2015} }'
chicago: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
ieee: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc
Networks. Universität Paderborn, 2015.
mla: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic
Ad-Hoc Networks. Universität Paderborn, 2015.
short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:30:02Z
date_updated: 2018-03-21T09:30:02Z
file_id: '1476'
file_name: 270-Dissertation_-_Abshoff.pdf
file_size: 448614
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:30:02Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '274'
abstract:
- lang: eng
text: Consider the problem in which n jobs that are classified into k types are
to be scheduled on m identical machines without preemption. A machine requires
a proper setup taking s time units before processing jobs of a given type. The
objective is to minimize the makespan of the resulting schedule. We design and
analyze an approximation algorithm that runs in time polynomial in n,m and k and
computes a solution with an approximation factor that can be made arbitrarily
close to 3/2.
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling
on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:542--553.
doi:10.1007/978-3-319-21840-3_45'
apa: 'Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015).
Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack,
& U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium,
WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553).
https://doi.org/10.1007/978-3-319-21840-3_45'
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with
Setup Times}, DOI={10.1007/978-3-319-21840-3_45},
booktitle={Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015},
pages={542--553}, collection={Lecture Notes in Computer Science} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings, edited by Frank Dehne, Jörg Rüdiger Sack, and
Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21840-3_45.'
ieee: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive
Scheduling on Machines with Setup Times,” in Algorithms and Data Structures:
14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015.
Proceedings, 2015, pp. 542--553.'
mla: 'Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup
Times.” Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank
Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.'
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne,
J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International
Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015,
pp. 542--553.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:39Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21840-3_45
editor:
- first_name: Frank
full_name: Dehne, Frank
last_name: Dehne
- first_name: Jörg Rüdiger
full_name: Sack, Jörg Rüdiger
last_name: Sack
- first_name: Ulrike
full_name: Stege, Ulrike
last_name: Stege
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:28:34Z
date_updated: 2018-03-21T09:28:34Z
file_id: '1473'
file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf
file_size: 215498
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:28:34Z
has_accepted_license: '1'
page: 542--553
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015,
Victoria, BC, Canada, August 5-7, 2015. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Non-preemptive Scheduling on Machines with Setup Times
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '275'
abstract:
- lang: eng
text: 'We investigate a non-cooperative game-theoretic model for the formation of
communication networks by selfish agents. Each agent aims for a central position
at minimum cost for creating edges. In particular, the general model (Fabrikant
et al., PODC''03) became popular for studying the structure of the Internet or
social networks. Despite its significance, locality in this game was first studied
only recently (Bilò et al., SPAA''14), where a worst case locality model was presented,
which came with a high efficiency loss in terms of quality of equilibria. Our
main contribution is a new and more optimistic view on locality: agents are limited
in their knowledge and actions to their local view ranges, but can probe different
strategies and finally choose the best. We study the influence of our locality
notion on the hardness of computing best responses, convergence to equilibria,
and quality of equilibria. Moreover, we compare the strength of local versus non-local
strategy changes. Our results address the gap between the original model and the
worst case locality variant. On the bright side, our efficiency results are in
line with observations from the original model, yet we have a non-constant lower
bound on the Price of Anarchy.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Pascal
full_name: Lenzner, Pascal
last_name: Lenzner
citation:
ama: 'Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local.
In: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS). LNCS. ; 2015:248--260. doi:10.1007/978-3-662-48054-0_21'
apa: 'Cord-Landwehr, A., & Lenzner, P. (2015). Network Creation Games: Think
Global - Act Local. In Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS) (pp. 248--260). https://doi.org/10.1007/978-3-662-48054-0_21'
bibtex: '@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network
Creation Games: Think Global - Act Local}, DOI={10.1007/978-3-662-48054-0_21},
booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015},
pages={248--260}, collection={LNCS} }'
chicago: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” In Proceedings of the 40th Conference on Mathematical
Foundations of Computer Science (MFCS), 248--260. LNCS, 2015. https://doi.org/10.1007/978-3-662-48054-0_21.'
ieee: 'A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global -
Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260.'
mla: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.'
short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on
Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:40Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-662-48054-0_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:27:12Z
date_updated: 2018-03-21T09:27:12Z
file_id: '1472'
file_name: 275-978-3-662-48054-0_21.pdf
file_size: 279995
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:27:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--260
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)
series_title: LNCS
status: public
title: 'Network Creation Games: Think Global - Act Local'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '276'
author:
- first_name: Till
full_name: Hohenberger, Till
last_name: Hohenberger
citation:
ama: Hohenberger T. Network Creation Games with Interest Groups. Universität
Paderborn; 2015.
apa: Hohenberger, T. (2015). Network Creation Games with Interest Groups.
Universität Paderborn.
bibtex: '@book{Hohenberger_2015, title={Network Creation Games with Interest Groups},
publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2015} }'
chicago: Hohenberger, Till. Network Creation Games with Interest Groups.
Universität Paderborn, 2015.
ieee: T. Hohenberger, Network Creation Games with Interest Groups. Universität
Paderborn, 2015.
mla: Hohenberger, Till. Network Creation Games with Interest Groups. Universität
Paderborn, 2015.
short: T. Hohenberger, Network Creation Games with Interest Groups, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:43Z
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Network Creation Games with Interest Groups
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '278'
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
citation:
ama: Feldmann M. Monotonic Searchability for Distributed Sorted Lists and De
Bruijn Graphs. Universität Paderborn; 2015.
apa: Feldmann, M. (2015). Monotonic Searchability for distributed sorted Lists
and De Bruijn Graphs. Universität Paderborn.
bibtex: '@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted
Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann,
Michael}, year={2015} }'
chicago: Feldmann, Michael. Monotonic Searchability for Distributed Sorted Lists
and De Bruijn Graphs. Universität Paderborn, 2015.
ieee: M. Feldmann, Monotonic Searchability for distributed sorted Lists and De
Bruijn Graphs. Universität Paderborn, 2015.
mla: Feldmann, Michael. Monotonic Searchability for Distributed Sorted Lists
and De Bruijn Graphs. Universität Paderborn, 2015.
short: M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De
Bruijn Graphs, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:45Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '21505'
author:
- first_name: David
full_name: Hein, David
id: '7728'
last_name: Hein
- first_name: Patrick
full_name: Giese, Patrick
last_name: Giese
- first_name: Gerson
full_name: Meschut, Gerson
id: '32056'
last_name: Meschut
orcid: 0000-0002-2763-1246
- first_name: Peter
full_name: Gumbsch, Peter
last_name: Gumbsch
- first_name: Silke
full_name: Sommer, Silke
last_name: Sommer
- first_name: Matthias
full_name: Bier, Matthias
last_name: Bier
citation:
ama: 'Hein D, Giese P, Meschut G, Gumbsch P, Sommer S, Bier M. Charakterisierung
und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit
für den profilintensiven Leichtbau unter Crashbelastung. In: FOSTA, EFB, DVS,
ed. ; 2015.'
apa: Hein, D., Giese, P., Meschut, G., Gumbsch, P., Sommer, S., & Bier, M. (2015).
Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger
Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung. In FOSTA,
EFB, DVS (Ed.). Presented at the 5. Fügetechnisches Gemeinschaftskolloquium “Gemeinsame
Forschung in der Mechanischen Fügetechnik,” Paderborn.
bibtex: '@inproceedings{Hein_Giese_Meschut_Gumbsch_Sommer_Bier_2015, title={Charakterisierung
und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit
für den profilintensiven Leichtbau unter Crashbelastung}, author={Hein, David
and Giese, Patrick and Meschut, Gerson and Gumbsch, Peter and Sommer, Silke and
Bier, Matthias}, editor={FOSTA, EFB, DVSEditor}, year={2015} }'
chicago: Hein, David, Patrick Giese, Gerson Meschut, Peter Gumbsch, Silke Sommer,
and Matthias Bier. “Charakterisierung Und Modellierung von Mechanischen Fügeverbindungen
Mit Einseitiger Zugänglichkeit Für Den Profilintensiven Leichtbau Unter Crashbelastung.”
edited by FOSTA, EFB, DVS, 2015.
ieee: D. Hein, P. Giese, G. Meschut, P. Gumbsch, S. Sommer, and M. Bier, “Charakterisierung
und Modellierung von mechanischen Fügeverbindungen mit einseitiger Zugänglichkeit
für den profilintensiven Leichtbau unter Crashbelastung,” presented at the 5.
Fügetechnisches Gemeinschaftskolloquium “Gemeinsame Forschung in der Mechanischen
Fügetechnik,” Paderborn, 2015.
mla: Hein, David, et al. Charakterisierung Und Modellierung von Mechanischen
Fügeverbindungen Mit Einseitiger Zugänglichkeit Für Den Profilintensiven Leichtbau
Unter Crashbelastung. Edited by FOSTA, EFB, DVS, 2015.
short: 'D. Hein, P. Giese, G. Meschut, P. Gumbsch, S. Sommer, M. Bier, in: FOSTA,
EFB, DVS (Ed.), 2015.'
conference:
end_date: 2015-12-09
location: Paderborn
name: 5. Fügetechnisches Gemeinschaftskolloquium “Gemeinsame Forschung in der Mechanischen
Fügetechnik”
start_date: 2015-12-08
corporate_editor:
- FOSTA, EFB, DVS
date_created: 2021-03-15T14:15:21Z
date_updated: 2022-01-06T06:55:02Z
department:
- _id: '157'
language:
- iso: eng
status: public
title: Charakterisierung und Modellierung von mechanischen Fügeverbindungen mit einseitiger
Zugänglichkeit für den profilintensiven Leichtbau unter Crashbelastung
type: conference
user_id: '7728'
year: '2015'
...
---
_id: '21506'
author:
- first_name: David
full_name: Hein, David
id: '7728'
last_name: Hein
- first_name: Patrick
full_name: Giese, Patrick
last_name: Giese
- first_name: Gerson
full_name: Meschut, Gerson
id: '32056'
last_name: Meschut
orcid: 0000-0002-2763-1246
- first_name: Peter
full_name: Gumbsch, Peter
last_name: Gumbsch
- first_name: Silke
full_name: Sommer, Silke
last_name: Sommer
- first_name: Matthias
full_name: Bier, Matthias
last_name: Bier
- first_name: Alfred
full_name: Iwainsky, Alfred
last_name: Iwainsky
- first_name: Daniel
full_name: Herfert, Daniel
last_name: Herfert
- first_name: Matthias
full_name: Günther, Matthias
last_name: Günther
citation:
ama: 'Hein D, Giese P, Meschut G, et al. Daten- und prognosebasierte Generierung
von Modellparametern für die Crashsimulation mechanisch gefügter Verbindungen.
In: FOSTA, EFB, DVS, ed. 5. Fügetechnisches Gemeinschaftskolloquium. ;
2015.'
apa: Hein, D., Giese, P., Meschut, G., Gumbsch, P., Sommer, S., Bier, M., … Günther,
M. (2015). Daten- und prognosebasierte Generierung von Modellparametern für die
Crashsimulation mechanisch gefügter Verbindungen. In FOSTA, EFB, DVS (Ed.), 5.
Fügetechnisches Gemeinschaftskolloquium. Paderborn.
bibtex: '@inproceedings{Hein_Giese_Meschut_Gumbsch_Sommer_Bier_Iwainsky_Herfert_Günther_2015,
title={Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation
mechanisch gefügter Verbindungen}, booktitle={5. Fügetechnisches Gemeinschaftskolloquium},
author={Hein, David and Giese, Patrick and Meschut, Gerson and Gumbsch, Peter
and Sommer, Silke and Bier, Matthias and Iwainsky, Alfred and Herfert, Daniel
and Günther, Matthias}, editor={FOSTA, EFB, DVSEditor}, year={2015} }'
chicago: Hein, David, Patrick Giese, Gerson Meschut, Peter Gumbsch, Silke Sommer,
Matthias Bier, Alfred Iwainsky, Daniel Herfert, and Matthias Günther. “Daten-
Und Prognosebasierte Generierung von Modellparametern Für Die Crashsimulation
Mechanisch Gefügter Verbindungen.” In 5. Fügetechnisches Gemeinschaftskolloquium,
edited by FOSTA, EFB, DVS, 2015.
ieee: D. Hein et al., “Daten- und prognosebasierte Generierung von Modellparametern
für die Crashsimulation mechanisch gefügter Verbindungen,” in 5. Fügetechnisches
Gemeinschaftskolloquium, Paderborn, 2015.
mla: Hein, David, et al. “Daten- Und Prognosebasierte Generierung von Modellparametern
Für Die Crashsimulation Mechanisch Gefügter Verbindungen.” 5. Fügetechnisches
Gemeinschaftskolloquium, edited by FOSTA, EFB, DVS, 2015.
short: 'D. Hein, P. Giese, G. Meschut, P. Gumbsch, S. Sommer, M. Bier, A. Iwainsky,
D. Herfert, M. Günther, in: FOSTA, EFB, DVS (Ed.), 5. Fügetechnisches Gemeinschaftskolloquium,
2015.'
conference:
end_date: 2015-12-09
location: Paderborn
name: 5. Fügetechnisches Gemeinschaftskolloquium “Gemeinsame Forschung in der Mechanischen
Fügetechnik”
start_date: 2015-12-08
corporate_editor:
- FOSTA, EFB, DVS
date_created: 2021-03-15T14:20:14Z
date_updated: 2022-01-06T06:55:02Z
department:
- _id: '157'
language:
- iso: eng
publication: 5. Fügetechnisches Gemeinschaftskolloquium
status: public
title: Daten- und prognosebasierte Generierung von Modellparametern für die Crashsimulation
mechanisch gefügter Verbindungen
type: conference
user_id: '7728'
year: '2015'
...