@article{60707,
author = {{Foltz, A and Thiele, K and Kahsnitz, D and Stenneken, P}},
journal = {{ Journal of Child Language}},
number = {{4}},
pages = {{932--945}},
title = {{{Children's syntactic-priming magnitude: Lexical factors and participant characteristics}}},
doi = {{ https://doi.org/10.1017/S0305000914000488 }},
volume = {{42}},
year = {{2015}},
}
@article{60705,
author = {{Foltz, A and Gaspers, J and Meyer, C and Thiele, K and Cimiano, P and Stenneken, P}},
journal = {{Discourse Processes}},
number = {{8}},
pages = {{609--641}},
title = {{{Temporal effects of alignment in text-based, task-oriented discourse}}},
doi = {{https://doi.org/10.1080/0163853X.2014.977696 }},
volume = {{52}},
year = {{2015}},
}
@article{60706,
author = {{Foltz, A and Gaspers, J and Thiele, K and Stenneken, P and Cimiano, P}},
journal = {{Frontiers in Psychology}},
title = {{{Lexical alignment in triadic communication}}},
doi = {{https://doi.org/10.3389/fpsyg.2015.00127 }},
volume = {{6}},
year = {{2015}},
}
@article{61771,
author = {{Schulte Eickholt, Swen}},
journal = {{Kritische Ausgabe}},
number = {{28}},
title = {{{Vom Unsagbaren sprechen. Literaturwissenschaftliche Zugänge zu einem weiten Feld}}},
year = {{2015}},
}
@article{37991,
abstract = {{The title compound, C17H18O5, was synthesized by a base-free catalytic Wittig reaction. The molecule consists of a diethyl itaconate unit, which is connectedviathe C=C double bond to a benzofuran moiety. The benzofuran ring system (r.m.s. deviation = 0.007 Å) forms dihedral angles of 79.58 (4) and 12.12 (10)° with the mean planes through thecisandtransethoxycarbonyl groups, respectively. An intramolecular C—H...O hydrogen bond involving the O atom of the benzofuran moiety is observed. In the crystal, molecules are linked into ribbons running parallel to thebaxis by C—H...O hydrogen bonds.}},
author = {{Schirmer, Marie-Luis and Spannenberg, Anke and Werner, Thomas}},
issn = {{2056-9890}},
journal = {{Acta Crystallographica Section E Crystallographic Communications}},
keywords = {{T2}},
number = {{11}},
pages = {{o872--o872}},
publisher = {{International Union of Crystallography (IUCr)}},
title = {{{Crystal structure of diethyl (E)-2-[(benzofuran-2-yl)methylidene]succinate}}},
doi = {{10.1107/s2056989015019313}},
volume = {{71}},
year = {{2015}},
}
@article{23748,
author = {{van Vorst, Helena and Dorschu, Alexandra and Fechner, Sabine and Kauertz, Alexander and Krabbe, Heiko and Sumfleth, Elke}},
issn = {{0949-1147}},
journal = {{Zeitschrift für Didaktik der Naturwissenschaften}},
number = {{1}},
pages = {{29--39}},
title = {{{Charakterisierung und Strukturierung von Kontexten im naturwissenschaftlichen Unterricht – Vorschlag einer theoretischen Modellierung}}},
doi = {{10.1007/s40573-014-0021-5}},
volume = {{21}},
year = {{2015}},
}
@inproceedings{57964,
author = {{Pieczewski, Julia and Neuschmelting, Volker and Thiele, Kristina and Grefkes, Christian and Goldbrunner, Roland and Weiss Lucas, Carolin }},
keywords = {{610 Medical sciences, Medicine, reliability, speech mapping, TMS}},
title = {{{Good retest reliability of the rate of speech errors evoked by 10 Hz navigated repetitive transcranial magnetic stimulation in healthy volunteers: German Medical Science GMS Publishing House}}},
doi = {{10.3205/15dgnc394}},
year = {{2015}},
}
@inproceedings{57966,
author = {{Pieczewski, J. and Neuschmelting, V. and Nettekoven, C. and Thiele, Kristina and Reck, N. and Goldbrunner, R. and Grefkes, C. and Lucas, C. Weiß}},
booktitle = {{Clinical Neurophysiology}},
issn = {{13882457}},
number = {{8}},
pages = {{e137}},
title = {{{P156. Good long-term error rate retest reliability of 10Hz neuronavigated repetitive TMS speech/language mapping in healthy volunteers}}},
doi = {{10.1016/j.clinph.2015.04.224}},
volume = {{126}},
year = {{2015}},
}
@article{25473,
author = {{Saleem, Muhammad and S. Padmanabhuni, Shanmukha and Ngonga Ngomo, Axel-Cyrille and Iqbal, Aftab and S. Almeida, Jonas and Decker, Stefan and F. Deus, Helena}},
journal = {{J. Biomed. Semant.}},
pages = {{47}},
title = {{{TopFed: TCGA Tailored Federated Query Processing and Linking to LOD}}},
doi = {{10.1186/2041-1480-5-47}},
volume = {{5}},
year = {{2014}},
}
@inproceedings{25492,
author = {{Soru, Tommaso and Ngonga Ngomo, Axel-Cyrille}},
booktitle = {{Proceedings of the 10th International Conference on Semantic Systems, {SEMANTICS} 2014, Leipzig, Germany, September 4-5, 2014}},
editor = {{Sack, Harald and Filipowska, Agata and Lehmann, Jens and Hellmann, Sebastian}},
pages = {{41--44}},
publisher = {{{ACM}}},
title = {{{A comparison of supervised learning classifiers for link discovery}}},
doi = {{10.1145/2660517.2660532}},
year = {{2014}},
}
@inproceedings{25493,
author = {{Marx, Edgard and Usbeck, Ricardo and Ngonga Ngomo, Axel-Cyrille and Höffner, Konrad and Lehmann, Jens and Auer, Sören}},
booktitle = {{Proceedings of the 10th International Conference on Semantic Systems, {SEMANTICS} 2014, Leipzig, Germany, September 4-5, 2014}},
editor = {{Sack, Harald and Filipowska, Agata and Lehmann, Jens and Hellmann, Sebastian}},
pages = {{57--60}},
publisher = {{{ACM}}},
title = {{{Towards an open question answering architecture}}},
doi = {{10.1145/2660517.2660519}},
year = {{2014}},
}
@inproceedings{25495,
author = {{Both, Andreas and Ngonga Ngomo, Axel-Cyrille and Usbeck, Ricardo and Lukovnikov, Denis and Lemke, Christiane and Speicher, Maximilian}},
booktitle = {{Proceedings of the 10th International Conference on Semantic Systems, {SEMANTICS} 2014, Leipzig, Germany, September 4-5, 2014}},
editor = {{Sack, Harald and Filipowska, Agata and Lehmann, Jens and Hellmann, Sebastian}},
pages = {{65--72}},
publisher = {{{ACM}}},
title = {{{A service-oriented search framework for full text, geospatial and semantic search}}},
doi = {{10.1145/2660517.2660528}},
year = {{2014}},
}
@article{19575,
author = {{Büker, Petra}},
journal = {{Praxis Deutsch, Sonderheft: Durch die Schuljahre 5/6}},
pages = {{96--100}},
title = {{{„Ich bin dafür, dass...“ Kinder gewinnen Standpunkte}}},
year = {{2014}},
}
@book{3389,
abstract = {{Dieses Lehr- und Arbeitsbuch präsentiert Ihnen die wichtigsten Grundlagen der Unternehmensfinanzierung auf dem neuesten fachlichen Stand. Der perfekte Einstieg in ein zentrales finanzwirtschaftliches Fach- und Praxisgebiet – mit vielen Beispielen und Übungen.
}},
author = {{Gräfer, Horst and Schiller, Bettina and Rösner, Sabrina}},
isbn = {{978-3-503-15666-5}},
keywords = {{Management, Wirtschaft}},
pages = {{405}},
publisher = {{Erich Schmidt Verlag}},
title = {{{Finanzierung - Grundlagen, Institutionen, Instrumente und Kapitalmarkttheorie}}},
volume = {{8}},
year = {{2014}},
}
@article{356,
abstract = {{Decentralized algorithms are often used in the cooperative robotics field, especially by large swarm systems. We present a distributed algorithm for a problem in which a group of autonomous mobile robots must surround a given target. These robots are oblivious, i.e., they have no memory of the past. They use only local sensing and need no dedicated communication among themselves. We introduce, then solve the problem in which the group of autonomous mobile robots must surround a given target – we call it the “discrete multiorbit target surrounding problem” (DMTSP). We evaluate our solution using simulation and prove that our solution invariably ensures that robots enclose the target in finite time. }},
author = {{Blazovics, Laszlo and Lukovszki, Tamas and Forstner, Bertalan }},
journal = {{Journal of Advanced Computational Intelligence and Intelligent Informatics}},
number = {{3}},
pages = {{315----319}},
publisher = {{Fuji Technology Press Ltd.}},
title = {{{Surrounding robots -- A discrete localized solution for the intruder problem}}},
doi = {{10.20965/jaciii.2014.p0315}},
year = {{2014}},
}
@inproceedings{367,
abstract = {{Online social networks are attracting billions of nowadays, both on a global scale as well as in social enterprise networks. Using distributed hash tables and peer-to-peer technology allows online social networks to be operated securely and efficiently only by using the resources of the user devices, thus alleviating censorship or data misuse by a single network operator. In this paper, we address the challenges that arise in implementing reliably and conveniently to use distributed data structures, such as lists or sets, in such a distributed hash-tablebased online social network. We present a secure, distributed list data structure that manages the list entries in several buckets in the distributed hash table. The list entries are authenticated, integrity is maintained and access control for single users and also groups is integrated. The approach for secure distributed lists is also applied for prefix trees and sets, and implemented and evaluated in a peer-to-peer framework for social networks. Evaluation shows that the distributed data structure is convenient and efficient to use and that the requirements on security hold.}},
author = {{Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman}},
booktitle = {{Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)}},
pages = {{396--405}},
title = {{{Secure Distributed Data Structures for Peer-to-Peer-based Social Networks}}},
doi = {{10.1109/CTS.2014.6867595}},
year = {{2014}},
}
@article{378,
abstract = {{The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again.}},
author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}},
journal = {{Theory of Computing Systems}},
number = {{3}},
pages = {{591--612}},
publisher = {{Springer}},
title = {{{Re-Chord: A Self-stabilizing Chord Overlay Network}}},
doi = {{10.1007/s00224-012-9431-2}},
year = {{2014}},
}
@inproceedings{379,
abstract = {{In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to.}},
author = {{Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}},
booktitle = {{Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}},
pages = {{25--34}},
title = {{{Randomized Online Algorithms for Set Cover Leasing Problems}}},
doi = {{10.1007/978-3-319-12691-3_3}},
year = {{2014}},
}
@inproceedings{380,
abstract = {{Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}}},
author = {{Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}},
booktitle = {{Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}},
pages = {{423--428}},
title = {{{Quality of Service in Network Creation Games}}},
doi = {{10.1007/978-3-319-13129-0_34}},
year = {{2014}},
}
@misc{391,
author = {{Feldkord, Björn}},
publisher = {{Universität Paderborn}},
title = {{{On Variants of the Page Migration Problem}}},
year = {{2014}},
}