774 resultados para Scalable video coding
Resumo:
A 57-year-old man with genetically proven facioscapulohumeral muscular dystrophy (FSHMD 1A) demonstrated Beevor sign (video on the Neurology Web site at www.neurology.org). The upward movement of the umbilicus in a supine patient flexing the neck or sitting up is named after the British neurologist Charles Edward Beevor (1854-1908). He described a "marked elevation of the umbilicus in the act of sitting up" due to a paralyzed infraumbilical part of the rectus abdominis muscle, indicating a lesion of the spinal cord between the segments T10 and T12 or its nerve roots.(1) Beevor sign may also be present, as in our patient, in myopathies affecting the abdominal muscles, particularly in FSHMD, in which predominant involvement of the lower part of the rectus abdominis muscle is typical.(2).
Resumo:
A reliable and robust routing service for Flying Ad-Hoc Networks (FANETs) must be able to adapt to topology changes, and also to recover the quality level of the delivered multiple video flows under dynamic network topologies. The user experience on watching live videos must also be satisfactory even in scenarios with network congestion, buffer overflow, and packet loss ratio, as experienced in many FANET multimedia applications. In this paper, we perform a comparative simulation study to assess the robustness, reliability, and quality level of videos transmitted via well-known beaconless opportunistic routing protocols. Simulation results shows that our developed protocol XLinGO achieves multimedia dissemination with Quality of Experience (QoE) support and robustness in a multi-hop, multi-flow, and mobile networks, as required in many multimedia FANET scenarios.
Resumo:
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.
Resumo:
Cloud Computing is an enabler for delivering large-scale, distributed enterprise applications with strict requirements in terms of performance. It is often the case that such applications have complex scaling and Service Level Agreement (SLA) management requirements. In this paper we present a simulation approach for validating and comparing SLA-aware scaling policies using the CloudSim simulator, using data from an actual Distributed Enterprise Information System (dEIS). We extend CloudSim with concurrent and multi-tenant task simulation capabilities. We then show how different scaling policies can be used for simulating multiple dEIS applications. We present multiple experiments depicting the impact of VM scaling on both datacenter energy consumption and dEIS performance indicators.
Resumo:
Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly useful in applications where partial data presents some utility. In this paper, we investigate the asymptotic performance of Growth codes using the Wormald method, which was proposed for studying the Peeling Decoder of LDPC and LDGM codes. Compared to previous works, the Wormald differential equations are set on nodes' perspective which enables a numerical solution to the computation of the expected asymptotic decoding performance of Growth codes. Our framework is appropriate for any class of Rateless codes that does not include a precoding step. We further study the performance of Growth codes with moderate and large size codeblocks through simulations and we use the generalized logistic function to model the decoding probability. We then exploit the decoding probability model in an illustrative application of Growth codes to error resilient video transmission. The video transmission problem is cast as a joint source and channel rate allocation problem that is shown to be convex with respect to the channel rate. This illustrative application permits to highlight the main advantage of Growth codes, namely improved performance in the intermediate loss region.
Resumo:
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.
Resumo:
The user experience on watching live video se- quences transmitted over a Flying Ad-Hoc Networks (FANETs) must be considered to drop packets in overloaded queues, in scenarios with high buffer overflow and packet loss rate. In this paper, we introduce a context-aware adaptation mechanism to manage overloaded buffers. More specifically, we propose a utility function to compute the dropping probability of each packet in overloaded queues based on video context information, such as frame importance, packet deadline, and sensing relevance. In this way, the proposed mechanism drops the packet that adds the minimum video distortion. Simulation evaluation shows that the proposed adaptation mechanism provides real-time multimedia dissemination with QoE support in a multi-hop, multi-flow, and mobile network environments.