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.     

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.     

An improved mechanism for multiple MBMS sessions assignment in B3G cellular networks

In Universal Mobile Telecommunication System (UMTS), the downlink capacity is limited by the base station transmission power. Therefore, power control plays an important role to minimize the transmitted power shared among unicast and multicast users within a cell. In Multimedia Broadcast/Multicast Service (MBMS), power control targets to the efficient utilization of radio and network resources. However, the expected high demand for such services stresses the need for an efficient scheme, capable of dynamically allocating radio resources to parallel MBMS sessions. This paper proposes a power control mechanism for efficient MBMS session assignment in next generation UMTS networks. The mechanism shares efficiently the available power resources of UMTS base stations to MBMS sessions running in the network. Furthermore, the mechanism is evaluated through several realistic scenarios and the results indicate the ability of the mechanism to utilize efficiently the radio resources and to ensure the service continuity when parallel MBMS services run in the network. Our approach is compared with current 3rd Generation Partnership Project (3GPP) approaches, such as these presented in TS 25.346 and in TR 25.922, in order to highlight the enhancements that it provides.     

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.     

Cost optimization of MBSFN and PTM transmissions for reliable multicasting in LTE networks

Long Term Evolution (LTE) systems have been specified and designed to accommodate small, high performance, power-efficient, end-user devices. The evolved Multimedia Broadcast/Multicast Service (e-MBMS) feature is introduced by the 3rd Generation Partnership Project (3GPP) as a complement to the existing MBMS service in order to accommodate multicast groups that are interested in receiving the same data. MBMS service is provided by MBMS over a Single Frequency Network (MBSFN) and/or Point-To-Multipoint (PTM) transmission methods. One of the challenges of MBMS is the complete error recovery of the transmitted files, a matter of great importance since the distribution of binary data must result in 100% error-free download. To fulfill this tight requirement, Forward Error Correction (FEC) mechanism has been proposed by 3GPP. In this work, we investigate the reliable multicasting by introducing a transmission method that combines the advantages of MBSFN and PTM transmission methods. We compare several FEC-based file recovery methods and evaluate them against various network parameters in a realistic simulation environment. The comparison is based on a cost-oriented analysis of MBMS service that takes into account the transmission cost over all the interfaces and nodes of the LTE architecture. The simulation results are performed with the aid of a new simulation tool and show that the performance of the file repair schemes depend on the network configuration.     

Process capability index for Poisson regression profile based on the Spmk index

In many process control applications, the quality of a process or a product can be characterized by a functional relationship between a response variable and one or more explanatory variables which is typically referred to as a profile. Such profiles can be expressed by a linear or a non-linear model. On the other hand, for an in-control process, capability indices are used for process quality improvement. In this article, we propose a method to measure the process capability when the quality of the process is characterized by a Poisson regression profile. The performance of the proposed index is evaluated through simulations studies. Two real data examples illustrate this method.