@inbook{44532,
  author       = {{Burban, Igor and Drozd, Yu.}},
  booktitle    = {{A series of Lecture Notes in Pure and Applied Mathematics}},
  pages        = {{23–46}},
  title        = {{{Derived categories for nodal rings and projective configurations, Noncommutative Algebra and Geometry}}},
  volume       = {{243}},
  year         = {{2005}},
}

@article{44354,
  author       = {{Burban, Igor}},
  journal      = {{Ukrain. Mat. Zh.}},
  number       = {{1}},
  title        = {{{Derived Categories and D-Branes}}},
  volume       = {{57}},
  year         = {{2005}},
}

@article{44353,
  author       = {{Burban, Igor and Kreußler, B.}},
  journal      = {{J. Reine Angew. Math.}},
  pages        = {{45–82}},
  title        = {{{Fourier-Mukai transforms and semi-stable sheaves on nodal Weierstraß cubics}}},
  volume       = {{584}},
  year         = {{2005}},
}

@inproceedings{64536,
  author       = {{Gerhardt, Nils Christopher and Hövel, Stephan and Brenner, Carsten and Hofmann, Martin and Reuter, Dirk and Wieck, Andreas and Yang, Junling}},
  booktitle    = {{Physics and simulation of optoelectronic devices XIII}},
  pages        = {{221 -- 229}},
  title        = {{{Spin-controlled LEDs and VCSELs}}},
  doi          = {{10.1117/12.590346}},
  year         = {{2005}},
}

@article{64535,
  author       = {{Gerhardt, Nils Christopher and Hövel, Stephan and Brenner, Carsten and Hofmann, Martin and Lo, Fang-Yuh and Reuter, Dirk and Wieck, Andreas and Westerholt, Kurt and Schuster, Ellen Ursula and Keune, Werner}},
  journal      = {{Applied physics letters}},
  number       = {{3}},
  pages        = {{1 -- 3}},
  title        = {{{Electron spin injection into GaAs from ferromagnetic contacts in remanence}}},
  doi          = {{10.1063/1.1996843}},
  volume       = {{87}},
  year         = {{2005}},
}

@unpublished{64741,
  author       = {{Glöckner, Helge}},
  title        = {{{Finite order differentiability properties, fixed points and implicit functions over valued fields}}},
  year         = {{2005}},
}

@article{64700,
  author       = {{Glöckner, Helge}},
  issn         = {{0022-1236}},
  journal      = {{Journal of Functional Analysis}},
  keywords     = {{22E65, 22E35, 26E15, 26E20, 26E30, 46S10, 46T20, 58C20}},
  number       = {{2}},
  pages        = {{419–444}},
  title        = {{{Hölder continuous homomorphisms between infinite-dimensional Lie groups are smooth}}},
  doi          = {{10.1016/j.jfa.2005.06.023}},
  volume       = {{228}},
  year         = {{2005}},
}

@article{64702,
  author       = {{Glöckner, Helge}},
  issn         = {{0232-704X}},
  journal      = {{Annals of Global Analysis and Geometry}},
  keywords     = {{22E65, 26E15, 26E20, 46T20, 58C20}},
  number       = {{3}},
  pages        = {{227–255}},
  title        = {{{Conveniently Hölder homomorphisms are smooth in the convenient sense}}},
  doi          = {{10.1007/s10455-005-0040-z}},
  volume       = {{27}},
  year         = {{2005}},
}

@article{64704,
  author       = {{Glöckner, Helge}},
  issn         = {{0021-8693}},
  journal      = {{Journal of Algebra}},
  keywords     = {{22E50}},
  number       = {{1}},
  pages        = {{356–371}},
  title        = {{{Smooth Lie groups over local fields of positive characteristic need not be analytic}}},
  doi          = {{10.1016/j.jalgebra.2004.11.018}},
  volume       = {{285}},
  year         = {{2005}},
}

@article{64701,
  author       = {{Glöckner, Helge}},
  issn         = {{0017-0895}},
  journal      = {{Glasgow Mathematical Journal}},
  keywords     = {{22D05, 22D40, 22D45}},
  number       = {{2}},
  pages        = {{329–333}},
  title        = {{{Contraction groups for tidy automorphisms of totally disconnected groups}}},
  doi          = {{10.1017/S0017089505002557}},
  volume       = {{47}},
  year         = {{2005}},
}

@article{64703,
  author       = {{Glöckner, Helge}},
  issn         = {{0025-584X}},
  journal      = {{Mathematische Nachrichten}},
  keywords     = {{58D05, 22E65, 46F05, 46T20}},
  number       = {{9}},
  pages        = {{1025–1032}},
  title        = {{{Diff(R^n) as a Milnor-Lie group}}},
  doi          = {{10.1002/mana.200310288}},
  volume       = {{278}},
  year         = {{2005}},
}

@article{64699,
  author       = {{Glöckner, Helge}},
  issn         = {{0010-437X}},
  journal      = {{Compositio Mathematica}},
  keywords     = {{22E65, 26E15, 26E20, 26E30, 46T05}},
  number       = {{6}},
  pages        = {{1551–1577}},
  title        = {{{Fundamentals of direct limit Lie theory}}},
  doi          = {{10.1112/S0010437X05001491}},
  volume       = {{141}},
  year         = {{2005}},
}

@article{51409,
  author       = {{Hilgert, Joachim and Deitmar, A.}},
  journal      = {{Documenta Math.}},
  pages        = {{199--216}},
  title        = {{{Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces}}},
  volume       = {{10}},
  year         = {{2005}},
}

@inproceedings{2529,
  author       = {{Köpke, A. and Karl, Holger and Wolisz, A. }},
  booktitle    = {{GI / ITG Fachgespräche Drahtlose Sensornetzwerke}},
  title        = {{{Consensus in WSN – Identifying critical protocol mechanisms}}},
  year         = {{2004}},
}

@phdthesis{19616,
  author       = {{Salzwedel, Kay}},
  isbn         = {{3-935433-62-X}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Data Distribution Algorithms for Storage Networks}}},
  volume       = {{153}},
  year         = {{2004}},
}

@inproceedings{19692,
  author       = {{Briest, Patrick and Brockhoff, Dimo and Degener, Bastian and Englert, Matthias and Gunia, Christian and Heering, Oliver and Jansen, Thomas and Leifhelm, Michael and Plociennik, Kai and Röglin, Heiko and Schweer, Andrea and Sudholt, Dirk and Tannenbaum, Stefan and Wegener, Ingo}},
  booktitle    = {{Parallel Problem Solving from Nature - PPSN VIII}},
  isbn         = {{9783540230922}},
  issn         = {{0302-9743}},
  title        = {{{The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes}}},
  doi          = {{10.1007/978-3-540-30217-9_4}},
  year         = {{2004}},
}

@inproceedings{19693,
  author       = {{Schweer, Andrea and Leifhelm, Michael and Degener, Bastian and Heering, Oliver and Tannenbaum, Stefan and Röglin, Heiko and Gunia, Christian and Englert, Matthias and Briest, Patrick and Sudholt, Dirk and Brockhoff, Dimo and Wegener, Ingo and Jansen, Thomas and Plociennik, Kai}},
  booktitle    = {{Parallel Problem Solving from Nature - PPSN VIII}},
  title        = {{{Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization}}},
  year         = {{2004}},
}

@inproceedings{19800,
  abstract     = {{Redundant arrays of independent disks, also called RAID arrays, have gained a wide popularity in the last twenty years. Most of the disks used in the server market are currently based on RAID technology. The primary reason for introducing RAID technology in 1988 has been the fact that large disk systems have become much slower and more expensive than the connection of a large number of inexpensive disks and the use of them as an array. The times seem to repeat themselves. Today, large scale RAID arrays have become incredible big and expensive. It seems that it makes sense to replace them by a collection of smaller and inexpensive arrays of JBODs or mid-ranged RAID arrays. In this paper we will show that combining these systems with state-of-the-art virtualization technology can lead to a system that is faster and less expensive than an enterprise storage system, while being as easy to manage and as reliable. Therefore we will outline the most important features of storage management and compare there realization in enterprise class storage systems and in current and future virtualization environments.}},
  author       = {{Brinkmann, André and Salzwedel, Kay and Vodisek, Mario}},
  booktitle    = {{Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI '04}},
  pages        = {{9--16}},
  title        = {{{A case for virtualized arrays of RAID}}},
  doi          = {{10.1145/1162628.1162630}},
  year         = {{2004}},
}

@inproceedings{19807,
  abstract     = {{Wireless connectivity is state of the art for local area networks. Currently, most W-LAN networks rely on a centralized design with access points routing all inner and outbound traffic. These access points are intrinsic communication bottlenecks. Mobile Ad Hoc Networks (MANET) overcome this problem, because every participant works as well as a simple node and as a router. Current MANETs are restricted in scalability, because they rely on flooding mechanisms or complete routing tables. Other approaches, providing better scalability use clustering, yet network performance deteriorates in case of high node mobility. We describe the design of a PAMANET, the Paderborn Mobile Ad Hoc Network, a MANET overcoming these problems providing scalability and reliability in a mobile scenario. When implemented, PAMANET works with standard W-LAN IEEE 802.11 radio devices, provides IPv6 communication interfaces and works on personal computers under a standard Linux distribution. First, we present current routing protocols and classify them with respect to scalability and stability in dynamically evolving MANETs. Then, we discuss related research in the area of distributed hash tables and consistent hashing, used for relieving hot spots in the Web, storage area networks and peerto-peer networks, which inspires the design of PAMANET. PAMANET consists of three main components: First, the embedding of the routing layer into IEEE 802.11 and IPv6 by using techniques used at the ad hoc support library (aslib) by Gupta et al. Second, the routing layer which combines a landmark routing, hierarchical clustering, consistent hashing for providing location dependent addresses and lookup-service for the location of nodes. Third, a peerto-peer data storage system based on egoistic distributed caches enabling hop and traffic efficient data access on replicated data partitions. <br>The routing layer incorporates a variety of new approaches. Link distances reflect the failure probability of links, which is estimated by the reciprocal age of the link. Then, we combine a landmarking system on this metric with the hierarchical layer graph yielding small landmark addresses and small routing tables. To balance the load of the distributed lookup-service for landmark addresses, a hierarchical weighted consistent hashing scheme is used. This ensures that each node receives an equal part of all landmark addresses. Using these mechanisms (regularly and on demand) PAMANET adjusts IPv6 routing tables such that short stable routes are preferred. For the distribution of control data like landmark information PAMANET uses a message box system interface to provide fast one-hop communication. On top of this system, PAMANET provides a peer-to-peer data storage and lookup system that realizes time, traffic, and load efficient access using egoistic caches and data segmentation strategies.}},
  author       = {{Schindelhauer, Christian and Böttcher, Stefan and Rammig, Franz}},
  booktitle    = {{Proceedings of the second international workshop on Mobility management & wireless access protocols}},
  isbn         = {{1581139209}},
  title        = {{{The design of PaMaNet the Paderborn mobile ad-hoc network}}},
  doi          = {{10.1145/1023783.1023807}},
  year         = {{2004}},
}

@inproceedings{19851,
  abstract     = {{The Internet-SCSI protocol [iSCSI] allows a client to interact with a remote SCSI-capable target by means of block-oriented commands encapsulated within TCP/IP packets. Thereby, iSCSI greatly simplifies storage virtualization, since clients can access storage in a unified manner, no matter whether the I/O-path is short or long distance. Intermediate devices located on the path between a client and a target can easily intercept iSCSI sessions and rewrite packets for the sake of load balancing, prefetching, or redundancy, to mention just a few beneficial applications. Within this paper we describe the design and implementation of such an iSCSI capable intermediate device that deploys prefetching strategies in combination with redundant disks to reduce average I/O-latency. Depending on its location within the network, this virtualization and prefetching device can hide wide area access latency and reduce network contention targeting remote SCSI-devices to a large extent.}},
  author       = {{Bleckmann, Peter and Schomaker, Gunnar and Slowik, Adrian}},
  booktitle    = {{Proceeding of International Workshop on Storage Network Architecture and Parallel I/O}},
  number       = {{2}},
  pages        = {{40--47}},
  title        = {{{Virtualization with prefetching abilities based on iSCSI}}},
  doi          = {{10.1145/1162628.1162634}},
  year         = {{2004}},
}

