Application layer forward error correction for multicast streaming over LTE networks

The next step beyond third generation mobile networks is the Third Generation Partnership Project standard, named Long Term Evolution. A key feature of Long Term Evolution is the enhancement of multimedia broadcast and multicast services (MBMS), where the same content is transmitted to multiple users located in a specific service area. To support efficient download and streaming delivery, the Third Generation Partnership Project included an application layer forward error correction (AL‐FEC) technique based on the systematic fountain Raptor code, in the MBMS standard. To achieve protection against packet losses, Raptor codes introduce redundant packets to the transmission, that is, the forward error correction overhead. In this work, we investigate the application of AL‐FEC over MBMS streaming services. We consider the benefits of AL‐FEC for a continuous multimedia stream transmission to multiple users and we examine how the amount of forward error correction redundancy can be adjusted under different packet loss conditions. For this purpose, we present a variety of realistic simulation scenarios for the application of AL‐FEC and furthermore we provide an in‐depth analysis of Raptor codes performance introducing valuable suggestions to achieve efficient use of Raptor codes. Copyright © 2012 John Wiley & Sons, Ltd.     

Nonparametric triple exponentially weighted moving average signed-rank control chart for monitoring shifts in the process location

Nonparametric (or distribution-free) control charts are used for monitoring processes where there is a lack of knowledge about the underlying distribution. In this article, a triple exponentially weighted moving average control chart based on the signed-rank statistic (referred as TEWMA-SR chart) is proposed for monitoring shifts in the location parameter of an unknown, but continuous and symmetric, distribution. The run-length characteristics of the proposed chart are evaluated performing Monte Carlo simulations. A comparison study with other existing nonparametric control charts based on the signed-rank statistic, the TEWMA sign chart, and the parametric TEWMA-$\overline{X}$ chart indicates that the proposed chart is more effective in detecting small shifts, while it is comparable with the other charts for moderate and large shifts. Finally, two illustrative examples are provided to demonstrate the application of the proposed chart.     

Monitoring of time between events with a double generally weighted moving average control chart

Monitoring of time between events (TBE) instead of the number of events is used in high‐quality processes where the events occur rarely. This article presents a double generally weighted moving average control chart with a lower time‐varying control limit to monitor the TBE (regarded as DGWMA‐TBE chart). The design parameters of the proposed chart are provided, and through a simulation study, it is shown that the DGWMA‐TBE chart is more effective than the DEWMA and GWMA charts in detecting moderate to large shifts. Furthermore, the DGWMA‐TBE chart is very robust for the same range of shifts when the TBE observations follow a Weibull or a lognormal distribution. Finally, examples are also presented to enhance the performance of the proposed chart.     

Random access prediction structures for light field video coding with MV-HEVC

Multimedia Tools and Applications - Computational imaging and light field technology promise to deliver the required six-degrees-of-freedom for natural scenes in virtual reality. Already existing...     

Effect of replacing soybean meal by extruded chickpeas in the diets of growing-finishing pigs on meat quality

The main objective of this study was to evaluate the effect of the replacement of soybean meal by extruded chickpeas in diets of growing-finishing pigs on meat quality. In a 17wk study 48 growing-finishing crossbred pigs were fed ad libitum. The experimental design included four treatments, each one of 12 pigs; the ECKP0 treatment was fed with diet containing soybean meal and no chickpeas (control), while treatments ECKP100, ECKP200 and ECKP300 were fed with diets containing 100, 200 and 300kg/t of extruded chickpeas, respectively. The lean meat quality of the longissimus lumborum et thoracis muscle was evaluated by chemical analysis (moisture, protein, fat and ash), fatty acid profile, pH measurement, cooking loss, color evaluation, and sensory evaluation. Odor and taste, tenderness, juiciness, and overall acceptability were scored on 1-10 scales by a group of 10 experienced assessors after a standard cooking regime. Small differences were observed between control and experimental groups in chemical composition (P>0.05). Fatty acid profiles, pH measurements and color evaluation did not differ among treatments (P>0.05), while cooking loss was significantly lower in the control group (P<0.05). The taste panel gave slightly higher scores for the tenderness and juiciness for the control group compared with the chickpea treatments (P<0.05). No differences were observed between control and experimental groups in taste scores (P>0.05). It is concluded that the replacement of soybean meal by extruded chickpeas, when substituted isonitrogenously and isoenergetically at inclusion levels up to 300kg/t of pig, does not influence significantly meat quality.     

Cost analysis and efficient radio bearer selection for multicasting over UMTS

Along with the widespread deployment of the Third Generation (3G) cellular networks, the fast‐improving capabilities of the mobile devices, content, and service providers are increasingly interested in supporting multicast communications over wireless networks and in particular over Universal Mobile Telecommunications System (UMTS). To this direction, the Third Generation Partnership Project (3GPP) is currently standardizing the Multimedia Broadcast/Multicast Service (MBMS) framework of UMTS. In this paper, we present an overview of the MBMS multicast mode of UMTS. We analytically present the multicast mode of the MBMS and analyze its performance in terms of packet delivery cost under various network topologies, cell types, and multicast users' distributions. Furthermore, for the evaluation of the scheme, we consider different transport channels for the transmission of the multicast data over the UMTS Terrestrial Radio‐Access Network (UTRAN) interfaces. Finally, we propose a scheme for the efficient radio bearer selection that minimizes total packet delivery cost. Copyright © 2008 John Wiley & Sons, Ltd.     

Encryption and watermarking for the secure distribution of copyrighted MPEG video on DVD

This paper presents a complete system for the secure distribution of a copyrighted MPEG-1/2 video stored on a DVD-ROM disc. A combined selective watermarking and encryption method that operates in the compressed MPEG domain is introduced. Watermarking resistant to a number of attacks is used for copyright protection. The video quality deteriorates significantly due to encryption, thus restraining unauthorized viewers from viewing it. The video can only be viewed using the developed Secure MPEG Player, which performs real-time decryption of the encrypted video. The decryption requires a secret key that is extracted from the DVD-ROM disc in a cryptographically secure manner.This work was supported by the EU IST Project "ASPIS"     

An elastic partial shape matching technique

We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that best matches a query. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a directed acyclic graph (DAG). The approach allows us to compute the optimal scale and translation of sequence values, which is a nontrivial problem in the case of subsequence matching. Our experimental results demonstrate that the proposed algorithm outperforms the commonly used techniques in retrieval accuracy.     

Decoupled Processors Architecture for Accelerating Data Intensive Applications using Scratch-Pad Memory Hierarchy

We present an architecture of decoupled processors with a memory hierarchy consisting only of scratch-pad memories, and a main memory. This architecture exploits the more efficient pre-fetching of Decoupled processors, that make use of the parallelism between address computation and application data processing, which mainly exists in streaming applications. This benefit combined with the ability of scratch-pad memories to store data with no conflict misses and low energy per access contributes significantly for increasing the system’s performance. The application code is split in two parallel programs the first runs on the Access processor and computes the addresses of the data in the memory hierarchy. The second processes the application data and runs on the Execute processor, a processor with a limited address space—just the register file addresses. Each transfer of any block in the memory hierarchy up to the Execute processor’s register file is controlled by the Access processor and the DMA units. This strongly differentiates this architecture from traditional uniprocessors and existing decoupled processors with cache memory hierarchies. The architecture is compared in performance with uniprocessor architectures with (a) scratch-pad and (b) cache memory hierarchies and (c) the existing decoupled architectures, showing its higher normalized performance. The reason for this gain is the efficiency of data transferring that the scratch-pad memory hierarchy provides combined with the ability of the Decoupled processors to eliminate memory latency using memory management techniques for transferring data instead of fixed prefetching methods. Experimental results show that the performance is increased up to almost 2 times compared to uniprocessor architectures with scratch-pad and up to 3.7 times compared to the ones with cache. The proposed architecture achieves the above performance without having penalties in energy delay product costs.     

Design and implementation of an efficient integer count sort in CUDA GPUs

We describe experience on design and implementation of an efficient count sort algorithm on Compute Unified Device Architecture graphics processing units. The novelty of this work is twofold. At first, we propose a count sort algorithm for integers that needs no synchronization at its last step and thus, offers superior performance. At second, this work contributes ad hoc techniques for optimizing the performance of the algorithm on Compute Unified Device Architecture‐enabled graphics processing units. Copyright © 2011 John Wiley & Sons, Ltd.