be discovered with a disk aware algorithm. The proposed algorithm is exact and requires only two linear scans of the disk with a tiny buffer of main memory. Furthermore, it is very simple to implement. We use the algorithm to provide further evidence of the effectiveness of the discord definition in areas

research in recent years, finding exact time series motifs in massive databases is an open problem. Previous efforts either found approximate motifs or considered relatively small datasets residing in main memory. In this work, we describe for the first time a disk-aware algorithm to find exact time series

t in some geographic zone Z, where both the location and shape of the delivery zone are a function of time over some interval (tstart , t end ). The protocol, called Face-Aware Routing (FAR), exploits ideas adapted from existing applications of face routing to achieve reliable mobicast delivery. The key

that will be present at time t in some geographic zone Z, where both the location and shape of the delivery zone are a function of time over some interval (tstart, tend). The protocol, called Face-Aware Routing (FAR), exploits ideas adapted from existing applications of face routing to achieve reliable mobicast

Strategies in Sensornets, provides substantial energy savings over existing techniques while providing comparable accuracy. We then introduce an efficient location discovery algorithm that bounds the localization error. Our algorithm, based on finding the smallest circle enclosing the intersection of n disks

understanding, sensemaking, situation awareness, knowledge engineering I. Introduction Software reverse engineering is a type of complex task which at the surface involves many common features with the cognitive processes of sensemaking and situation awareness. In particular, reverse engineering an executable

I declare that this thesis is my own account of my research and contains as its main content work which has not previously been submitted for a degree at any tertiary education institution.

I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present the work on various conferences, for which I thank him. I would also like to thank Prof. Dr. Roger Wattenhofer, responsible for the Koreferat of this work. Also, Prof. Dr. Oscar Nierstrasz who was willing to be the co-examinator of this work deserves many thanks. Many thanks go to my colleagues of the RVS group and of the IAM for our various interesting discussions about all kinds of topics and for making the institute a very pleasant and friendly place to work at. Special thanks go to David Steiner, Marc Steinemann, Matthias Scheidegger, Florian Baumgartner, Ruy De Oliveira, and Attila Weyland. There are many students who worked with me and helped a lot in developing and implementing. Among them I especially thankful to Thomas Bernoulli,

As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but deployments of such algorithms are currently uncommon because of some practical difficulties.

1. Networking trends 2. QoS over data networks 3. Label switching 4. Gigabit, 10 Gb Ethernet, RPR 5. Storage area networks 6. IP over DWDM 7. Wireless 8. Voice over IP