Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against function contracts, which are expressed in terms of pre-, post-, and frame conditions using first-order predicates. Vx86 takes

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

I first thank my thesis advisors Thiemo Voigt and Adam Dunkels for being my excellent advisors, and also for being the great colleagues you still are. Thiemo and Adam have complemented each other superbly, giving me feedback, perspectives, insights, and having made every single new venture truly fun. My deepest thanks also go to my professor Per Gunningberg, Uppsala University. Per has in a seemingly easy way spotted erroneous assumptions, has valued my research contributions, and has connected my own work with another broader world of research. I want to thank all colleagues in the Networked Embedded Systems group:

of statistical mechanics. Examples of such active units in complex physico-chemical and biological systems are chemically pow-ered nano-rods, localized patterns in reaction-diffusion system, motile cells or macroscopic animals. Based on the description of individual motion of point-like active particles

Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information,

Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations

Abstract not found

Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterization of the RKHS associated with the SLGM, we derive a lower bound on the minimum variance achievable by estimators with a prescribed bias function, including the important special case of unbiased estimation. This bound is obtained via an orthogonal projection of the prescribed mean function onto a subspace of the RKHS associated with the SLGM. It provides an approximation to the minimum achievable variance (Barankin bound) that is tighter than any known bound. Our bound holds for an arbitrary system matrix, including the overdetermined and underdetermined cases. We specialize

reliable, low-cost monitoring of migratory species. The developed multi-tier architecture yields ecologists with unconventional behavior in-formation not furnished by alternative tracking systems at such a large scale and for a low-cost. The simulation, development and implementation of the Crane

Messaging is a basic service in sensornets. Yet the unique system and application prop-erties of sensornets pose substantial challenges for the messaging design: Firstly, dynamic wireless links, constrained resources, and application diversity challenge the architecture and protocol design of sensornet messaging; Secondly, complex faults and large system scale introduce new challenges to the design of fault-tolerant protocols. The objective of this dissertation is to address the aforementioned challenges of sensornet messaging. Despite the extensive effort in studying sensornet messaging, the lack of a basic un-derstanding of its essential components has been an obstacle for reliable, efcient, and reusable messaging services in sensornets. To address this problem, one task of this dis-sertation is to identify the basic components of sensornet messaging and to study the re-lated algorithmic design issues. More specically, we propose the messaging architecture SMA that consists of three components: trafc-adaptive link estimation and routing (TLR), application-adaptive structuring (AST), and application-adaptive scheduling (ASC). TLR deals with dynamic wireless links as well as the impact of application trafc patterns on