A Calculus of Evolving Objects

The demands of developing modern, highly dynamic applications have led to an increasing interest in dynamic programming languages and mechanisms. Not only must applications evolve over time, but the object models themselves may need to be adapted to the requirements of different run-time contexts. Class-based models and prototype-based models, for example, may need to co-exist to meet the demands of dynamically evolving applications. Multi-dimensional dispatch, fine-grained and dynamic software composition, and run-time evolution of behaviour are further examples of diverse mechanisms which may need to co-exist in a dynamically evolving run-time environment. How can we model the semantics of these highly dynamic features, yet still offer some reasonable safety guarantees? To this end we present an original calculus in which objects can adapt their behaviour at run-time. Both objects and environments are represented by first-class mappings between variables and values. Message sends are dynamically resolved to method calls. Variables may be dynamically bound, making it possible to model a variety of dynamic mechanisms within the same calculus. Despite the highly dynamic nature of the calculus, safety properties are assured by a type assignment system.

Retention in care under universal antiretroviral therapy for HIV-infected pregnant and breastfeeding women ('Option B+') in Malawi

OBJECTIVE To explore the levels and determinants of loss to follow-up (LTF) under universal lifelong antiretroviral therapy (ART) for pregnant and breastfeeding women ('Option B+') in Malawi. DESIGN, SETTING, AND PARTICIPANTS We examined retention in care, from the date of ART initiation up to 6 months, for women in the Option B+ program. We analysed nationwide facility-level data on women who started ART at 540 facilities (n = 21 939), as well as individual-level data on patients who started ART at 19 large facilities (n = 11 534). RESULTS Of the women who started ART under Option B+ (n = 21 939), 17% appeared to be lost to follow-up 6 months after ART initiation. Most losses occurred in the first 3 months of therapy. Option B+ patients who started therapy during pregnancy were five times more likely than women who started ART in WHO stage 3/4 or with a CD4 cell count 350 cells/μl or less, to never return after their initial clinic visit [odds ratio (OR) 5.0, 95% confidence interval (CI) 4.2-6.1]. Option B+ patients who started therapy while breastfeeding were twice as likely to miss their first follow-up visit (OR 2.2, 95% CI 1.8-2.8). LTF was highest in pregnant Option B+ patients who began ART at large clinics on the day they were diagnosed with HIV. LTF varied considerably between facilities, ranging from 0 to 58%. CONCLUSION Decreasing LTF will improve the effectiveness of the Option B+ approach. Tailored interventions, like community or family-based models of care could improve its effectiveness.

Modeled Interaction of Comet 67P/Churyumov-Gerasimenko with the Solar Wind Inside 2 AU

Periodic comets move around the Sun on elliptical orbits. As such comet 67P/Churyumov-Gerasimenko (hereafter 67P) spends a portion of time in the inner solar system where it is exposed to increased solar insolation. Therefore given the change in heliocentric distance, in case of 67P from aphelion at 5.68 AU to perihelion at ~1.24 AU, the comet’s activity—the production of neutral gas and dust—undergoes significant variations. As a consequence, during the inbound portion, the mass loading of the solar wind increases and extends to larger spatial scales. This paper investigates how this interaction changes the character of the plasma environment of the comet by means of multifluid MHD simulations. The multifluid MHD model is capable of separating the dynamics of the solar wind ions and the pick-up ions created through photoionization and electron impact ionization in the coma of the comet. We show how two of the major boundaries, the bow shock and the diamagnetic cavity, form and develop as the comet moves through the inner solar system. Likewise for 67P, although most likely shifted back in time with respect to perihelion passage, this process is reversed on the outbound portion of the orbit. The presented model herein is able to reproduce some of the key features previously only accessible to particle-based models that take full account of the ions’ gyration. The results shown herein are in decent agreement to these hybrid-type kinetic simulations.

Information-Centric Content Retrieval for Delay-Tolerant Networks

The shift from host-centric to information-centric networking (ICN) promises seamless communication in mobile networks. However, most existing works either consider well-connected networks with high node density or introduce modifications to {ICN} message processing for delay-tolerant Networking (DTN). In this work, we present agent-based content retrieval, which provides information-centric {DTN} support as an application module without modifications to {ICN} message processing. This enables flexible interoperability in changing environments. If no content source can be found via wireless multi-hop routing, requesters may exploit the mobility of neighbor nodes (called agents) by delegating content retrieval to them. Agents that receive a delegation and move closer to content sources can retrieve data and return it back to requesters. We show that agent-based content retrieval may be even more efficient in scenarios where multi-hop communication is possible. Furthermore, we show that broadcast communication may not be necessarily the best option since dynamic unicast requests have little overhead and can better exploit short contact times between nodes (no broadcast delays required for duplicate suppression).

Information-centric communication in mobile and wireless networks

Information-centric networking (ICN) is a new communication paradigm that has been proposed to cope with drawbacks of host-based communication protocols, namely scalability and security. In this thesis, we base our work on Named Data Networking (NDN), which is a popular ICN architecture, and investigate NDN in the context of wireless and mobile ad hoc networks. In a first part, we focus on NDN efficiency (and potential improvements) in wireless environments by investigating NDN in wireless one-hop communication, i.e., without any routing protocols. A basic requirement to initiate informationcentric communication is the knowledge of existing and available content names. Therefore, we develop three opportunistic content discovery algorithms and evaluate them in diverse scenarios for different node densities and content distributions. After content names are known, requesters can retrieve content opportunistically from any neighbor node that provides the content. However, in case of short contact times to content sources, content retrieval may be disrupted. Therefore, we develop a requester application that keeps meta information of disrupted content retrievals and enables resume operations when a new content source has been found. Besides message efficiency, we also evaluate power consumption of information-centric broadcast and unicast communication. Based on our findings, we develop two mechanisms to increase efficiency of information-centric wireless one-hop communication. The first approach called Dynamic Unicast (DU) avoids broadcast communication whenever possible since broadcast transmissions result in more duplicate Data transmissions, lower data rates and higher energy consumption on mobile nodes, which are not interested in overheard Data, compared to unicast communication. Hence, DU uses broadcast communication only until a content source has been found and then retrieves content directly via unicast from the same source. The second approach called RC-NDN targets efficiency of wireless broadcast communication by reducing the number of duplicate Data transmissions. In particular, RC-NDN is a Data encoding scheme for content sources that increases diversity in wireless broadcast transmissions such that multiple concurrent requesters can profit from each others’ (overheard) message transmissions. If requesters and content sources are not in one-hop distance to each other, requests need to be forwarded via multi-hop routing. Therefore, in a second part of this thesis, we investigate information-centric wireless multi-hop communication. First, we consider multi-hop broadcast communication in the context of rather static community networks. We introduce the concept of preferred forwarders, which relay Interest messages slightly faster than non-preferred forwarders to reduce redundant duplicate message transmissions. While this approach works well in static networks, the performance may degrade in mobile networks if preferred forwarders may regularly move away. Thus, to enable routing in mobile ad hoc networks, we extend DU for multi-hop communication. Compared to one-hop communication, multi-hop DU requires efficient path update mechanisms (since multi-hop paths may expire quickly) and new forwarding strategies to maintain NDN benefits (request aggregation and caching) such that only a few messages need to be transmitted over the entire end-to-end path even in case of multiple concurrent requesters. To perform quick retransmission in case of collisions or other transmission errors, we implement and evaluate retransmission timers from related work and compare them to CCNTimer, which is a new algorithm that enables shorter content retrieval times in information-centric wireless multi-hop communication. Yet, in case of intermittent connectivity between requesters and content sources, multi-hop routing protocols may not work because they require continuous end-to-end paths. Therefore, we present agent-based content retrieval (ACR) for delay-tolerant networks. In ACR, requester nodes can delegate content retrieval to mobile agent nodes, which move closer to content sources, can retrieve content and return it to requesters. Thus, ACR exploits the mobility of agent nodes to retrieve content from remote locations. To enable delay-tolerant communication via agents, retrieved content needs to be stored persistently such that requesters can verify its authenticity via original publisher signatures. To achieve this, we develop a persistent caching concept that maintains received popular content in repositories and deletes unpopular content if free space is required. Since our persistent caching concept can complement regular short-term caching in the content store, it can also be used for network caching to store popular delay-tolerant content at edge routers (to reduce network traffic and improve network performance) while real-time traffic can still be maintained and served from the content store.

Europeanization and the inclusive strategies of executive actors

In Europeanized policy domains, executive actors are considered especially powerful because they are directly responsible for international negotiations. However, in order to avoid failing in the ratification process, they are also highly dependent on the support of domestic, non-state actors. We argue that in Europeanized decision-making processes, state actors are not passively lobbied, but actively seek collaboration with - and support from - domestic actors. We apply stochastic actor-based modelling for network dynamics to collaboration data on two successive bilateral agreements on the free movement of persons between Switzerland and the European Union (EU). Results confirm our hypotheses that state actors are not passively lobbied, but actively look for collaboration with other actors, and especially with potential veto players and euro-sceptical actors from both the conservative Right and the Left.