The role of the interplay between polymer architecture and bacterial surface properties on the microbial adhesion to polyoxazoline-based ultrathin films

Surface platforms were engineered from poly(L-lysine)-graft-poly(2-methyl-2-oxazoline) (PLL-g-PMOXA) copolymers to study the mechanisms involved in the non-specific adhesion of Escherichia coli (E. coli) bacteria. Copolymers with three different grafting densities (PMOXA chains/Lysine residue of 0.09, 0.33 and 0.56) were synthesized and assembled on niobia (Nb O ) surfaces. PLL-modified and bare niobia surfaces served as controls. To evaluate the impact of fimbriae expression on the bacterial adhesion, the surfaces were exposed to genetically engineered E. coli strains either lacking, or constitutively expressing type 1 fimbriae. The bacterial adhesion was strongly influenced by the presence of bacterial fimbriae. Non-fimbriated bacteria behaved like hard, charged particles whose adhesion was dependent on surface charge and ionic strength of the media. In contrast, bacteria expressing type 1 fimbriae adhered to the substrates independent of surface charge and ionic strength, and adhesion was mediated by non-specific van der Waals and hydrophobic interactions of the proteins at the fimbrial tip. Adsorbed polymer mass, average surface density of the PMOXA chains, and thickness of the copolymer films were quantified by optical waveguide lightmode spectroscopy (OWLS) and variable-angle spectroscopic ellipsometry (VASE), whereas the lateral homogeneity was probed by time-of-flight secondary ion mass spectrometry (ToF-SIMS). Streaming current measurements provided information on the charge formation of the polymer-coated and the bare niobia surfaces. The adhesion of both bacterial strains could be efficiently inhibited by the copolymer film only with a grafting density of 0.33 characterized by the highest PMOXA chain surface density and a surface potential close to zero.

LUPA: a European initiative taking advantage of the canine genome architecture for unravelling complex disorders in both human and dogs

The domestic dog offers a unique opportunity to explore the genetic basis of disease, morphology and behaviour. Humans share many diseases with our canine companions, making dogs an ideal model organism for comparative disease genetics. Using newly developed resources, genome-wide association studies in dog breeds are proving to be exceptionally powerful. Towards this aim, veterinarians and geneticists from 12 European countries are collaborating to collect and analyse the DNA from large cohorts of dogs suffering from a range of carefully defined diseases of relevance to human health. This project, named LUPA, has already delivered considerable results. The consortium has collaborated to develop a new high density single nucleotide polymorphism (SNP) array. Mutations for four monogenic diseases have been identified and the information has been utilised to find mutations in human patients. Several complex diseases have been mapped and fine mapping is underway. These findings should ultimately lead to a better understanding of the molecular mechanisms underlying complex diseases in both humans and their best friend.

Architecture of European plastic surgery

The architecture of European Plastic Surgery was published in 1996 [Nicolai JPA, Scuderi N. Plastic surgical Europe in an organogram. Eur J Plast Surg 1996; 19: 253-256.] It is the objective of this paper to update information of that article. Continuing medical education (CME), science, training, examination, quality assurance and relations with the European Commission and Parliament all are aspects covered by the organisations to be discussed.

Use of concatamers to study GABAA receptor architecture and function: application to delta-subunit-containing receptors and possible pitfalls

Many membrane proteins, including the GABA(A) [GABA (gamma-aminobutyric acid) type A] receptors, are oligomers often built from different subunits. As an example, the major adult isoform of the GABA(A) receptor is a pentamer built from three different subunits. Theoretically, co-expression of three subunits may result in many different receptor pentamers. Subunit concatenation allows us to pre-define the relative arrangement of the subunits. This method may thus be used to study receptor architecture, but also the nature of binding sites. Indeed, it made possible the discovery of a novel benzodiazepine site. We use here subunit concatenation to study delta-subunit-containing GABA(A) receptors. We provide evidence for the formation of different functional subunit arrangements in recombinant alpha(1)beta(3)delta and alpha(6)beta(3)delta receptors. As with all valuable techniques, subunit concatenation has also some pitfalls. Most of these can be avoided by carefully titrating and minimizing the length of the linker sequences joining the two linked subunits and avoiding inclusion of the signal sequence of all but the N-terminal subunit of a multi-subunit construct. Maybe the most common error found in the literature is that low expression can be overcome by simply overloading the expression system with genetic information. As some concatenated constructs result by themselves in a low level of expression, this erroneous assembly leading to receptor function may be promoted by overloading the expression system and leads to wrong conclusions.

Lake Floor Morphology and Sediment Architecture of Lake Torneträsk, Northern Sweden

ABSTRACT. Here we present datasets from a hydroacoustic survey in July 2011 at Lake Torneträsk, northern Sweden. Our hydroacoustic data exhibit lake floor morphologies formed by glacial erosion and accumulation processes, insights into lacustrine sediment accumulation since the beginning of deglaciation, and information on seismic activity along the Pärvie Fault. Features of glacial scouring with a high-energy relief, steep slopes, and relative reliefs of more than 50 m are observed in the large W-basin. The remainder of the lacustrine subsurface appears to host a broad variety of well preserved formations from glacial accumulation related to the last retreat of the Fennoscandian ice sheet. Deposition of glaciolacustrine and lacustrine sediments is focused in areas situated in proximity to major inlets. Sediment accumulation in distal areas of the lake seldom exceeds 2 m or is not observable. We assume that lack of sediment deposition in the lake is a result of different factors, including low rates of erosion in the catchment, a previously high lake level leading to deposition of sediments in higher elevated paleodeltas, tributaries carrying low suspension loads as a result of sedimentation in upstream lakes, and an overall low productivity in the lake. A clear off-shore trace of the Pärvie Fault could not be detected from our hydroacoustic data. However, an absence of sediment disturbance in close proximity to the presumed fault trace implies minimal seismic activity since deposition of the glaciolacustrine and lacustrine sediments.

Persistent Caching in Information-Centric Networks

Information-centric networking (ICN) is a new communication paradigm that aims at increasing security and efficiency of content delivery in communication networks. In recent years, many research efforts in ICN have focused on caching strategies to reduce traffic and increase overall performance by decreasing download times. Since caches need to operate at line speed, they have only a limited size and content can only be stored for a short time. However, if content needs to be available for a longer time, e.g., for delay-tolerant networking or to provide high content availability similar to content delivery networks (CDNs), persistent caching is required. We base our work on the Content-Centric Networking (CCN) architecture and investigate persistent caching by extending the current repository implementation in CCNx. We show by extensive evaluations in a YouTube and webserver traffic scenario that repositories can be efficiently used to increase content availability by significantly increasing cache hit rates.

Towards Information-Centric Wireless Multi-hop Communication

Information-centric networking (ICN) addresses drawbacks of the Internet protocol, namely scalability and security. ICN is a promising approach for wireless communication because it enables seamless mobile communication, where intermediate or source nodes may change, as well as quick recovery from collisions. In this work, we study wireless multi-hop communication in Content-Centric Networking (CCN), which is a popular ICN architecture. We propose to use two broadcast faces that can be used in alternating order along the path to support multi-hop communication between any nodes in the network. By slightly modifying CCN, we can reduce the number of duplicate Interests by 93.4 % and the number of collisions by 61.4 %. Furthermore, we describe and evaluate different strategies for prefix registration based on overhearing. Strategies that configure prefixes only on one of the two faces can result in at least 27.3 % faster data transmissions.

Persistent Caching in Information-Centric Networking

Information-centric networking (ICN) is a new communication paradigm that aims at increasing security and efficiency of content delivery in communication networks. In recent years, many research efforts in ICN have focused on caching strategies to reduce traffic and increase overall performance by decreasing download times. Since caches need to operate at line-speed, they have only a limited size and content can only be stored for a short time. However, if content needs to be available for a longer time, e.g., for delay-tolerant networking or to provide high content availability similar to content delivery networks (CDNs), persistent caching is required. We base our work on the Content-Centric Networking (CCN) architecture and investigate persistent caching by extending the current repository implementation in CCNx. We show by extensive evaluations in a YouTube and webserver traffic scenario that repositories can be efficiently used to increase content availability by significantly increasing the cache hit rates.

Dynamic Unicast: Information-Centric Multi-hop Routing for Mobile Ad-hoc Networks

Abstract Information-centric networking (ICN) offers new perspectives on mobile ad-hoc communication because routing is based on names but not on endpoint identifiers. Since every content object has a unique name and is signed, authentic content can be stored and cached by any node. If connectivity to a content source breaks, it is not necessarily required to build a new path to the same source but content can also be retrieved from a closer node that provides the same content copy. For example, in case of collisions, retransmissions do not need to be performed over the entire path but due to caching only over the link where the collision occurred. Furthermore, multiple requests can be aggregated to improve scalability of wireless multi-hop communication. In this work, we base our investigations on Content-Centric Networking (CCN), which is a popular {ICN} architecture. While related works in wireless {CCN} communication are based on broadcast communication exclusively, we show that this is not needed for efficient mobile ad-hoc communication. With Dynamic Unicast requesters can build unicast paths to content sources after they have been identified via broadcast. We have implemented Dynamic Unicast in CCNx, which provides a reference implementation of the {CCN} concepts, and performed extensive evaluations in diverse mobile scenarios using NS3-DCE, the direct code execution framework for the {NS3} network simulator. Our evaluations show that Dynamic Unicast can result in more efficient communication than broadcast communication, but still supports all {CCN} advantages such as caching, scalability and implicit content discovery.

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.