Quantification of water content across a cement-clay interface using high resolution neutron radiography

In many designs for radioactive waste repositories, cement and clay will come into direct contact. The geochemical contrast between cement and clay will lead to mass fluxes across the interface, which consequently results in alteration of structural and transport properties of both materials that may affect the performance of the multi-barrier system. We present an experimental approach to study cement-clay interactions with a cell to accommodate small samples of cement and clay. The cell design allows both in situ measurement of water content across the sample using neutron radiography and measurement of transport parameters using through-diffusion tracer experiments. The aim of the high- resolution neutron radiography experiments was to monitor changes in water content (porosity) and their spatial extent. Neutron radiographs of several evolving cement-clay interfaces delivered quantitative data which allow resolving local water contents within the sample domain. In the present work we explored the uncertainties of the derived water contents with regard to various input parameters and with regard to the applied image correction procedures. Temporal variation of measurement conditions created absolute uncertainty of the water content in the order of ±0.1 (m3/m3), which could not be fully accounted for by correction procedures. Smaller relative changes in water content between two images can be derived by specific calibrations to two sample regions with different, invariant water contents.

NetCodCCN: a Network Coding approach for Content-Centric Networks

Content-Centric Networking (CCN) naturally supports multi-path communication, as it allows the simultaneous use of multiple interfaces (e.g. LTE and WiFi). When multiple sources and multiple clients are considered, the optimal set of distribution trees should be determined in order to optimally use all the available interfaces. This is not a trivial task, as it is a computationally intense procedure that should be done centrally. The need for central coordination can be removed by employing network coding, which also offers improved resiliency to errors and large throughput gains. In this paper, we propose NetCodCCN, a protocol for integrating network coding in CCN. In comparison to previous works proposing to enable network coding in CCN, NetCodCCN permit Interest aggregation and Interest pipelining, which reduce the data retrieval times. The experimental evaluation shows that the proposed protocol leads to significant improvements in terms of content retrieval delay compared to the original CCN. Our results demonstrate that the use of network coding adds robustness to losses and permits to exploit more efficiently the available network resources. The performance gains are verified for content retrieval in various network scenarios.

3' end processing of mouse histone pre-mRNA: evidence for additional base-pairing between U7 snRNA and pre-mRNA.

We have analysed the extent of base-pairing interactions between spacer sequences of histone pre-mRNA and U7 snRNA present in the trans-acting U7 snRNP and their importance for histone RNA 3' end processing in vitro. For the efficiently processed mouse H4-12 gene, a computer analysis revealed that additional base pairs could be formed with U7 RNA outside of the previously recognised spacer element (stem II). One complementarity (stem III) is located more 3' and involves nucleotides from the very 5' end of U7 RNA. The other, more 5' located complementarity (stem I) involves nucleotides of the Sm binding site of U7 RNA, a part known to interact with snRNP structural proteins. These potential stem structures are separated from each other by short internal loops of unpaired nucleotides. Mutational analyses of the pre-mRNA indicate that stems II and III are equally important for interaction with the U7 snRNP and for processing, whereas mutations in stem I have moderate effects on processing efficiency, but do not impair complex formation with the U7 snRNP. Thus nucleotides near the processing site may be important for processing, but do not contribute to the assembly of an active complex by forming a stem I structure. The importance of stem III was confirmed by the ability of a complementary mutation in U7 RNA to suppress a stem III mutation in a complementation assay using Xenopus laevis oocytes. The main role of the factor(s) binding to the upstream hairpin loop is to stabilise the U7-pre-mRNA complex. This was shown by either stabilising (by mutation) or destabilising (by increased temperature) the U7-pre-mRNA base-pairing under conditions where hairpin factor binding was either allowed or prevented (by mutation or competition). The hairpin dependence of processing was found to be inversely related to the strength of the U7-pre-mRNA interaction.

Step by step: correcting our mental image of the mušlālu

The mušlālu, which is usually understood to be a step- or ramped gate, has so far rarely been discussed in much detail, even though the texts mentioning it have been known for a long time. This is no doubt because the evidence on which to base both philological and archaeological investigations appears sparse and scattered. Up to now, scholars have tended to focus on specific mušlālu-structures. Consequently, there are as many discussions as there are mušlālu-structures. This article attempts to get a sense of the broader picture by bringing together the philological and archaeological data hitherto available with the aim of discussing the mušlālu as term and structure, clarifying the semantics and reassessing the architectural identifications. We hope to demonstrate that it is actually possible to take the evidence one step further and correct the mušlālu image that prevails.

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.