Coordinated Autonomic Managers for Energy Efficient Date Centers

The complexity of today’s data centers has led researchers to investigate ways in which autonomic methods can be used for data center management. Autonomic managers try to monitor and manage resources to ensure that the components they manage are self-configuring, self-optimizing, self-healing and self-protecting (so called “self-*” properties). In this research, we consider autonomic management systems for data centers with a particular focus on making data centers more energy-aware. In particular, we consider a policy based, multi-manager autonomic management systems for energy aware data centers. Our focus is on defining the foundations – the core concepts, entities, relationships and algorithms - for autonomic management systems capable of supporting a range of management configurations. Central to our approach is the notion of a “topology” of autonomic managers that when instantiated can support a range of different configurations of autonomic managers and communication among them. The notion of “policy” is broadened to enable some autonomic managers to have more direct control over the behavior of other managers through changes in policies. The ultimate goal is to create a management framework that would allow the data center administrator to a) define managed objects, their corresponding managers, management system topology, and policies to meet their operation needs and b) rely on the management system to maintain itself automatically. A data center simulator that computes its energy consumption (computing and cooling) at any given time is implemented to evaluate the impact of different management scenarios. The management system is evaluated with different management scenarios in our simulated data center

Freedom of expression, the media and journalists : case-law of the European Court of Human Rights

This e-book (also available in a printed version) offers a structured insight into the European Court of Human Rights’ case-law on freedom of expression and media and journalistic freedoms has been a widely appreciated. It is presented as a vade mecum on Article 10 of the European Convention on Human Rights. The target group includes lawyers, judges, law- and policy-makers, civil society actors, journalists and other media actors, academics, students, and indeed everyone with an interest in its subject matter. This revised edition contains summaries of over 315 judgments or decisions by the Court and provides hyperlinks to the full text of each of the summarised judgments or decisions (via HUDOC, the Court’s online case-law database). It can be read in various ways: for initial orientation in the steadily growing Article 10 case-law; for refreshing one’s knowledge of that case-law; for quick reference and checking, as well as for substantive research. The structure of the e-book is as follows: 1. Table of cases: an overview of all the cases summarised, including bibliographic data, keywords, hyperlinks to the individual summaries and hyperlinks to the full texts of the judgments or decisions. 2. Introduction by Dirk Voorhoof to trends and developments in the European Court of Human Rights’ case-law on Article 10 of the European Convention on Human Rights in the period 1994-2019. 3. Compilation of case-law summaries. 4. Appendices

Application coordination in pervasive systems

Our future environment will be managed by a multitude of different pervasive systems. A pervasive system consists of users and devices which cooperate to provide functionality to the users. The provision of functionality is realized by pervasive applications. A major characteristic of pervasive applications is their context-interactivity. On one hand, pervasive applications are context-aware and can adapt themselves to changing context. This ability enables them to provide their functionality in different configurations. On the other hand, pervasive applications have the ability to influence and change the context themselves. A context change can be caused implicitly as a side effect of employed resources or explicitly through the use of actuators. Due to the context-interactivity, problems are likely to occur when two or more applications are executed in the same physical space. Since applications share a common context and interact with it, they can have a direct impact on each other. The described problem is defined as an interference in this thesis. An interference is an application-produced context that impairs the functionality provision of another application. To manage interferences in pervasive systems, a coordination framework is presented. The framework detects interferences using a context model and information about how applications interact with the shared context. The resolution of an interference is achieved through a coordinated application adaptation. The idea is based on the assumption that an alternative application configuration may yield a different context interaction. Thus, the framework determines a configuration for each application such that the context interactions do not interfere. Once a configuration is found for each application, the framework instructs applications to instantiate the selected configuration, resolving the interference. The framework is unique due to three design decisions. At first, the framework is realized as a cross-system coordination layer in order to allow an integration of arbitrary systems. Secondly, the integration of applications can be achieved through the extension of existing systems while preserving their system characteristics. Thirdly, the framework supports a generic interface to integrate arbitrary resolution strategies in order to allow the customization of the framework to the needs of different pervasive systems. The thesis introduces the theoretical concepts of the framework, presents a prototypical implementation and evaluates the prototype and its implemented concepts through extensive measurements

Trustworthy Wireless Personal Area Networks

In the Internet of Things (IoT), everyday objects are equipped with the ability to compute and communicate. These smart things have invaded the lives of everyday people, being constantly carried or worn on our bodies, and entering into our homes, our healthcare, and beyond. This has given rise to wireless networks of smart, connected, always-on, personal things that are constantly around us, and have unfettered access to our most personal data as well as all of the other devices that we own and encounter throughout our day. It should, therefore, come as no surprise that our personal devices and data are frequent targets of ever-present threats. Securing these devices and networks, however, is challenging. In this dissertation, we outline three critical problems in the context of Wireless Personal Area Networks (WPANs) and present our solutions to these problems. First, I present our Trusted I/O solution (BASTION-SGX) for protecting sensitive user data transferred between wirelessly connected (Bluetooth) devices. This work shows how in-transit data can be protected from privileged threats, such as a compromised OS, on commodity systems. I present insights into the Bluetooth architecture, Intel’s Software Guard Extensions (SGX), and how a Trusted I/O solution can be engineered on commodity devices equipped with SGX. Second, I present our work on AMULET and how we successfully built a wearable health hub that can run multiple health applications, provide strong security properties, and operate on a single charge for weeks or even months at a time. I present the design and evaluation of our highly efficient event-driven programming model, the design of our low-power operating system, and developer tools for profiling ultra-low-power applications at compile time. Third, I present a new approach (VIA) that helps devices at the center of WPANs (e.g., smartphones) to verify the authenticity of interactions with other devices. This work builds on past work in anomaly detection techniques and shows how these techniques can be applied to Bluetooth network traffic. Specifically, we show how to create normality models based on fine- and course-grained insights from network traffic, which can be used to verify the authenticity of future interactions

Reimplementing the Adcash Software Development Kit in Swift

Käesolevas väitekirjas käsitletakse Objective-C baasil loodud ja iOS operatsioonisüsteemil töötavat reklaamikuvamise rakendust. Magistritöö keskendub rakenduse ümberstruktureerimisele Swift keelde, kasutades viimase uuendusi ning arhitektuurilisi eeliseid.This thesis provides an overview of re-designing and reimplementing of an existing solution, that is used for presenting advertisements in iOS operating system applications. This has been done by reimplementing the existing Objective-C solution in Swift. During reimplementation, the SDK was re-architected in order to take advantage of the features that Swift provides

Type theory in a type theory with quotient inductive types

Type theory (with dependent types) was introduced by Per Martin-Löf with the intention of providing a foundation for constructive mathematics. A part of constructive mathematics is type theory itself, hence we should be able to say what type theory is using the formal language of type theory. In addition, metatheoretic properties of type theory such as normalisation should be provable in type theory. The usual way of defining type theory formally is by starting with an inductive definition of precontexts, pretypes and preterms and as a second step defining a ternary typing relation over these three components. Well-typed terms are those preterms for which there exists a precontext and pretype such that the relation holds. However, if we use the rich metalanguage of type theory to talk about type theory, we can define well-typed terms directly as an inductive family indexed over contexts and types. We believe that this latter approach is closer to the spirit of type theory where objects come intrinsically with their types. Internalising a type theory with dependent types is challenging because of the mutual definitions of types, terms, substitution of terms and the conversion relation. We use induction induction to express this mutual dependency. Furthermore, to reduce the type-theoretic boilerplate needed for reasoning in the syntax, we encode the conversion relation as the equality type of the syntax. We use equality constructors thus we define the syntax as a quotient inductive type (a special case of higher inductive types from homotopy type theory). We define the syntax of a basic type theory with dependent function space, a base type and a family over the base type as a quotient inductive inductive type. The definition of the syntax comes with a notion of model and an eliminator: whenever one is able to define a model, the eliminator provides a function from the syntax to the model. We show that this method of representing type theory is practically feasible by defining a number of models: the standard model, the logical predicate interpretation for parametricity (as a syntactic translation) and the proof-relevant presheaf logical predicate interpretation. By extending the latter with a quote function back into the syntax, we prove normalisation for type theory. This can be seen as a proof of normalisation by evaluation. Internalising the syntax of type theory is not only of theoretical interest. It opens the possibility of type-theoretic metaprogramming in a type-safe way. This could be used for generic programming in type theory and to implement extensions of type theory which are justified by models such as guarded type theory or homotopy type theory