the his-tory of the code due to both human and computational scalability issues. In this paper we address the substantial challenges of min-ing source code: a) at a very large scale; b) at a fine-grained level of detail; and c) with full history information. To address these challenges, we present domain

modifications are immediately registered in a trans-action log often called a ChangeSet. Such mechanism has proven reliability, but it has several limitations. In this pa-per we analyse such limitations and describe scenarios and requirements for tracking fine-grained code history with a semantic representation

modifications are immediately registered in a transaction log often called a ChangeSet. Such mechanism has proven reliability, but it has several limitations. In this paper we analyse such limitations and describe scenarios and requirements for tracking fine-grained code history with a semantic representation

views of the system discovering and indicating evolutionary highlights. To process the large amount of data, we extended our previously developed approach for storing release history information to support the analysis of product families. In a case study we apply our approach on data from three

Abstract Supporting database schema evolution repre-sents a long-standing challenge of practical and theoretical importance for modern information systems. In this paper, we describe techniques and systems for automating the critical tasks of migrating the database and rewriting the legacy

First, I would like to thank to Dimka Karastoyanova and Mariano Cilia for all the fruitful discussions, their guidance and support through the course of this project. Thanks also to Prof. Alejandro Buchmann who sponsored my stay at Technische Universität Darmstadt during the spring of 2004. The special thanks go to my advisor, Mariano Cilia, who has made all this possible. Finally, I’d like to thank to my family for all these years of support.

in partial ful2llment of the requirements for the degree of

Abstract not found

Copyright © 2012 Muhammad Hamad Alizai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We address the challenge of link estimation and routing over highly dynamic links, thats is, bursty links that rapidly shift between reliable and unreliable periods of transmissions. Based on significant empirical evidence of over 100,000 transmissions over each link in 802.15.4 and 802.11 testbeds, we propose two metrics, expected future transmissions (EFT) and MAC3, for runtime estimation of bursty wireless links.We introduce a bursty link estimator (BLE) that based on these twometrics, accurately estimates bursty links in the network rendering them available for data transmissions. Finally, we present bursty routing extensions (BRE): an adaptive routing strategy that uses BLE for forwarding packets over bursty links if they offer better routing progress than long-term stable links. Our evaluation, comprising experimental data from widely used IEEE 802.15.4-based testbeds, reveals an average of 19 % and a maximum of 42 % reduction in the number of transmissions when routing over long-range bursty links typically ignored by routing protocols. Additionally, we show that both BLE and BRE are not tied to any specific routing protocol and integrate seamlessly with existing routing protocols and link estimators. 1.

Abstract not found