Decoding Delay Minimization in Inter-Session Network Coding

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources transmit data to sets of clients over a wireline overlay network. We propose a novel framework for efficient rate allocation in networks where intermediate network nodes have the opportunity to combine packets from different sources using randomized network coding. We formulate the problem as the minimization of the average decoding delay in the client population and solve it with a gradient-based stochastic algorithm. Our optimized inter-session network coding solution is evaluated in different network topologies and is compared with basic intra-session network coding solutions. Our results show the benefits of proper coding decisions and effective rate allocation for lowering the decoding delay when the network is used by concurrent multicast sessions.

Distributed Rate Allocation in Inter-Session Network Coding

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user requests the content of one of the available sources. We propose a novel distributed algorithm where network users determine the coding operations and the packet rates to be requested from the parent nodes, such that the decoding delay is minimized for all clients. A rate allocation problem is solved by every user, which seeks the rates that minimize the average decoding delay for its children and for itself. Since this optimization problem is a priori non-convex, we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every user needs to collect for decoding. We then decompose our original rate allocation problem into a set of convex subproblems, which are eventually combined to obtain an effective approximate solution to the delay minimization problem. The results demonstrate that the proposed scheme eliminates the bottlenecks and reduces the decoding delay experienced by users with limited bandwidth resources. We validate the performance of our distributed rate allocation algorithm in different video streaming scenarios using the NS-3 network simulator. We show that our system is able to take benefit of inter-session network coding for simultaneous delivery of video sessions in networks with path diversity.

Interactive free viewpoint video streaming using prioritized network coding

In free viewpoint applications, the images are captured by an array of cameras that acquire a scene of interest from different perspectives. Any intermediate viewpoint not included in the camera array can be virtually synthesized by the decoder, at a quality that depends on the distance between the virtual view and the camera views available at decoder. Hence, it is beneficial for any user to receive camera views that are close to each other for synthesis. This is however not always feasible in bandwidth-limited overlay networks, where every node may ask for different camera views. In this work, we propose an optimized delivery strategy for free viewpoint streaming over overlay networks. We introduce the concept of layered quality-of-experience (QoE), which describes the level of interactivity offered to clients. Based on these levels of QoE, camera views are organized into layered subsets. These subsets are then delivered to clients through a prioritized network coding streaming scheme, which accommodates for the network and clients heterogeneity and effectively exploit the resources of the overlay network. Simulation results show that, in a scenario with limited bandwidth or channel reliability, the proposed method outperforms baseline network coding approaches, where the different levels of QoE are not taken into account in the delivery strategy optimization.

When small non-coding RNAs meet the ribosome: Tuning the translational machinery

The functions of ribosomes in translation are complex and involve different types of activities critical for decoding the genetic code, linkage of amino acids via amide bonds to form polypeptide chains, as well as the release and proper targeting of the synthesized protein. Non-protein-coding RNAs (ncRNAs) have been recognized to be crucial in establishing regulatory networks.1 However all of the recently discovered ncRNAs involved in translation regulation target the mRNA rather than the ribosome. The main goal of this project is to identify potential novel ncRNAs that directly bind and possibly regulate the ribosome during protein biosynthesis. To address this question we applied various stress conditions to the archaeal model organism Haloferax volcanii and deep-sequenced the ribosome-associated small ncRNA interactome. In total we identified 6.250 ncRNA candidates. Significantly, we observed the emersed presence of tRNA-derived fragments (tRFs). These tRFs have been identified in all domains of life and represent a growing, yet functionally poorly understood, class of ncRNAs. Here we present evidence that tRFs from H. volcanii directly bind to ribosomes. In the presented genomic screen of the ribosome-associated RNome a 26 residue long fragment originating from the 5’ part of valine tRNA was by far the most abundant tRF. The Val-tRF is processed in a stress- dependent manner and was found to primarily target the small ribosomal subunit in vitro and in vivo. As a consequence of ribosome binding, Val-tRF reduces protein synthesis by interfering with peptidyl transferase activity. Therefore this tRF functions as ribosome-bound small ncRNA capable of regulating gene expression in H. volcanii under environmental stress conditions probably by fine-tuning the rate of protein production.2 Currently we are investigating the binding site of this tRF on the 30S subunit in more detail.

Time for actions in lucid dreams: effects of task modality, length, and complexity

The relationship between time in dreams and real time has intrigued scientists for centuries. The question if actions in dreams take the same time as in wakefulness can be tested by using lucid dreams where the dreamer is able to mark time intervals with prearranged eye movements that can be objectively identified in EOG recordings. Previous research showed an equivalence of time for counting in lucid dreams and in wakefulness (LaBerge, 1985; Erlacher and Schredl, 2004), but Erlacher and Schredl (2004) found that performing squats required about 40% more time in lucid dreams than in the waking state. To find out if the task modality, the task length, or the task complexity results in prolonged times in lucid dreams, an experiment with three different conditions was conducted. In the first condition, five proficient lucid dreamers spent one to three non-consecutive nights in the sleep laboratory. Participants counted to 10, 20, and 30 in wakefulness and in their lucid dreams. Lucidity and task intervals were time stamped with left-right-left-right eye movements. The same procedure was used for these condition where eight lucid dreamers had to walk 10, 20, or 30 steps. In the third condition, eight lucid dreamers performed a gymnastics routine, which in the waking state lasted the same time as walking 10 steps. Again, we found that performing a motor task in a lucid dream requires more time than in wakefulness. Longer durations in the dream state were present for all three tasks, but significant differences were found only for the tasks with motor activity (walking and gymnastics). However, no difference was found for relative times (no disproportional time effects) and a more complex motor task did not result in more prolonged times. Longer durations in lucid dreams might be related to the lack of muscular feedback or slower neural processing during REM sleep. Future studies should explore factors that might be associated with prolonged durations.

tRNA-derived fragments target the small ribosomal subunit to fine-tune translation

Post-transcriptional cleavage of RNA molecules to generate smaller fragments is a widespread mechanism that enlarges the structural and functional complexity of cellular RNomes. In particular, fragments deriving from both precursor and mature tRNAs represent one of the rapidly growing classes of post-transcriptional RNA pieces. Importantly, these tRNA-derived fragments (tRFs) possess distinct expression patterns, abundance, cellular localizations, or biological roles compared with their parental tRNA molecules (1). Here we present evidence that tRFs from the archaeon Haloferax volcanii directly bind to ribosomes. In a previous genomic screen for ribosome-associated small RNAs we have identified a 26 residue long fragment originating from the 5’ part of valine tRNA (Val-tRF) to be by far the most abundant tRF in H. volcanii (2). The Val-tRF is processed in a stress- dependent manner and was found to primarily target the small ribosomal subunit in vitro and in vivo. Translational activity was markedly reduced in the presence of Val-tRF, while control RNA fragments of similar length did not show inhibition of protein biosynthesis. Crosslinking experiments and subsequent primer extension analyses revealed the Val-tRF interaction site to surround the mRNA path in the 30S subunit. In support of this, binding experiments demonstrated that Val-tRF does compete with mRNAs for ribosome binding. Therefore this tRF represents a ribosome-bound non-protein-coding RNA (ncRNA) capable of regulating gene expression in H. volcanii under environmental stress conditions probably by fine-tuning the rate of protein production (1). (1) Gebetsberger J. and Polacek N. (2013), RNA Biol. 10:1798-1808 (2) Gebetsberger J. et. al. (2012), Archaea, Article ID 260909

Temperate Mountain Forest Biodiversity under Climate Change: Compensating Negative Effects by Increasing Structural Complexity

Species adapted to cold-climatic mountain environments are expected to face a high risk of range contractions, if not local extinctions under climate change. Yet, the populations of many endothermic species may not be primarily affected by physiological constraints, but indirectly by climate-induced changes of habitat characteristics. In mountain forests, where vertebrate species largely depend on vegetation composition and structure, deteriorating habitat suitability may thus be mitigated or even compensated by habitat management aiming at compositional and structural enhancement. We tested this possibility using four cold-adapted bird species with complementary habitat requirements as model organisms. Based on species data and environmental information collected in 300 1-km2 grid cells distributed across four mountain ranges in central Europe, we investigated (1) how species’ occurrence is explained by climate, landscape, and vegetation, (2) to what extent climate change and climate-induced vegetation changes will affect habitat suitability, and (3) whether these changes could be compensated by adaptive habitat management. Species presence was modelled as a function of climate, landscape and vegetation variables under current climate; moreover, vegetation-climate relationships were assessed. The models were extrapolated to the climatic conditions of 2050, assuming the moderate IPCC-scenario A1B, and changes in species’ occurrence probability were quantified. Finally, we assessed the maximum increase in occurrence probability that could be achieved by modifying one or multiple vegetation variables under altered climate conditions. Climate variables contributed significantly to explaining species occurrence, and expected climatic changes, as well as climate-induced vegetation trends, decreased the occurrence probability of all four species, particularly at the low-altitudinal margins of their distribution. These effects could be partly compensated by modifying single vegetation factors, but full compensation would only be achieved if several factors were changed in concert. The results illustrate the possibilities and limitations of adaptive species conservation management under climate change.

cDNA Library Generation for the Analysis of Small RNAs by High-Throughput Sequencing

The RNome of a cell is highly diverse and consists besides messenger RNAs (mRNAs), transfer RNAs (tRNAs), and ribosomal RNAs (rRNAs) also of other small and long transcript entities without apparent coding potential. This class of molecules, commonly referred to as non-protein-coding RNAs (ncRNAs), is involved in regulating numerous biological processes and thought to contribute to cellular complexity. Therefore, much effort is put into their identification and further functional characterization. Here we provide a cost-effective and reliable method for cDNA library construction of small RNAs in the size range of 20-500 residues. The effectiveness of the described method is demonstrated by the analysis of ribosome-associated small RNAs in the eukaryotic model organism Trypanosoma brucei.

Complexity and non-linearity in earth surface processes - concepts, methods and applications

Complexity has long been recognized and is increasingly becoming mainstream in geomorphology. However, the relative novelty of various concepts and techniques associated to it means that ambiguity continues to surround complexity. In this commentary, we present and discuss a variety of recent contributions that have the potential to help clarify issues and advance the use of complexity in geomorphology.

Applicative theories for logarithmic complexity classes

We present applicative theories of words corresponding to weak, and especially logarithmic, complexity classes. The theories for the logarithmic hierarchy and alternating logarithmic time formalise function algebras with concatenation recursion as main principle. We present two theories for logarithmic space where the first formalises a new two-sorted algebra which is very similar to Cook and Bellantoni's famous two-sorted algebra B for polynomial time [4]. The second theory describes logarithmic space by formalising concatenation- and sharply bounded recursion. All theories contain the predicates WW representing words, and VV representing temporary inaccessible words. They are inspired by Cantini's theories [6] formalising B.

A coding variant in RARG confers susceptibility to anthracycline-induced cardiotoxicity in childhood cancer

Anthracyclines are used in over 50% of childhood cancer treatment protocols, but their clinical usefulness is limited by anthracycline-induced cardiotoxicity (ACT) manifesting as asymptomatic cardiac dysfunction and congestive heart failure in up to 57% and 16% of patients, respectively. Candidate gene studies have reported genetic associations with ACT, but these studies have in general lacked robust patient numbers, independent replication or functional validation. Thus, the individual variability in ACT susceptibility remains largely unexplained. We performed a genome-wide association study in 280 patients of European ancestry treated for childhood cancer, with independent replication in similarly treated cohorts of 96 European and 80 non-European patients. We identified a nonsynonymous variant (rs2229774, p.Ser427Leu) in RARG highly associated with ACT (P = 5.9 × 10(-8), odds ratio (95% confidence interval) = 4.7 (2.7-8.3)). This variant alters RARG function, leading to derepression of the key ACT genetic determinant Top2b, and provides new insight into the pathophysiology of this severe adverse drug reaction.