@book{24929, editor = {{Elit, Stefan and Bremer, Kai}}, publisher = {{Gardez!}}, title = {{{ Antike – Lyrik – Heute. Griechisch-römische Antike in deutschsprachiger Lyrik und Altphilologie der Gegenwart}}}, volume = {{7}}, year = {{2010}}, } @article{2510, author = {{Haake, Claus-Jochen and Klaus, Bettina}}, issn = {{0040-5833}}, journal = {{Theory and Decision}}, number = {{4}}, pages = {{537--554}}, publisher = {{Springer Nature}}, title = {{{Stability and Nash implementation in matching markets with couples}}}, doi = {{10.1007/s11238-008-9122-2}}, volume = {{69}}, year = {{2010}}, } @article{25402, author = {{Hoehndorf, Robert and Ngonga Ngomo, Axel-Cyrille and Kelso, Janet}}, journal = {{J. Biomed. Semant.}}, pages = {{4}}, title = {{{Applying the functional abnormality ontology pattern to anatomical functions}}}, doi = {{10.1186/2041-1480-1-4}}, volume = {{1}}, year = {{2010}}, } @article{25403, author = {{Ngonga Ngomo, Axel-Cyrille}}, journal = {{Informatica (Slovenia)}}, number = {{1}}, pages = {{37--43}}, title = {{{Low-Bias Extraction of Domain-Specific Concepts}}}, volume = {{34}}, year = {{2010}}, } @inproceedings{25404, author = {{Hoehndorf, Robert and Ngonga Ngomo, Axel-Cyrille and Pyysalo, Sampo and Ohta, Tomoko and Oellrich, Anika and Rebholz-Schuhmann, Dietrich}}, booktitle = {{Proceedings of the Fourth International Symposium for Semantic Mining in Biomedicine, Cambridge, United Kingdom, October, 2010}}, editor = {{Collier, Nigel and Hahn, Udo and Rebholz-Schuhmann, Dietrich and Rinaldi, Fabio and Pyysalo, Sampo}}, publisher = {{CEUR-WS.org}}, title = {{{Applying ontology design patterns to the implementation of relations in GENIA}}}, volume = {{714}}, year = {{2010}}, } @inbook{19628, author = {{Büker, Petra and Vorst, Claudia}}, booktitle = {{Lese- und Literaturunterricht (Deutschunterricht in Theorie und Praxis, Bd. 11/2)}}, editor = {{Kämper-van den Boogaart, Michael and Spinner, Kaspar H.}}, pages = {{21--48}}, publisher = {{Schneider Verlag}}, title = {{{Kompetenzen und Unterrichtsziele im Lese- und Literaturunterricht der Grundschule}}}, volume = {{11/2}}, year = {{2010}}, } @inproceedings{19678, author = {{Briest, Patrick and Röglin, Heiko}}, booktitle = {{Workshop on Approximation and Online Algorithms (WAOA)}}, publisher = {{Springer}}, title = {{{The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}}}, doi = {{10.1007/978-3-642-18318-8_5}}, volume = {{6534}}, year = {{2010}}, } @inproceedings{19711, author = {{Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}}, booktitle = {{International Parallel & Distributed Processing Symposium (IPDPS)}}, title = {{{A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }}}, doi = {{10.1109/IPDPS.2010.5470349}}, year = {{2010}}, } @inproceedings{19796, abstract = {{We introduce the Read-Write-Coding-System (RWC) – a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \leq r,w \leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\left(n,k,d\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.}}, author = {{Mense, Mario and Schindelhauer, Christian}}, booktitle = {{Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems}}, isbn = {{9783642051173}}, issn = {{0302-9743}}, pages = {{624----639}}, title = {{{Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}}}, doi = {{10.1007/978-3-642-05118-0_43}}, volume = {{5873}}, year = {{2010}}, } @inproceedings{19824, abstract = {{We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis.}}, author = {{Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian}}, booktitle = {{Proceedings of the 16th International Conference on Parallel and Distributed Systems}}, isbn = {{9781424497270}}, title = {{{A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}}}, doi = {{10.1109/icpads.2010.42}}, year = {{2010}}, }