XMPP and iDTV or how to make television a social medium

Instant Messaging (IM) has the potential to become one of the killer applications for interactive Digital Television (iDTV) [12]. However, several factors make it difficult to provide a good implementation of IM services, among which the limited resources of a set-top box and the different user experience compared to computer environments. This paper proposes the XMPP (Extensible Messaging and Presence Protocol) standard as a solution for implementing IM. When we compare XMPP with other technologies, it reveals itself to be very well adapted to the specific needs of iDTV middleware platforms like the Multimedia Home Platform (MHP) [5]. Moreover, the use of XMPP doesn't limit itself to IM The flexible architecture of XMPP opens a window of opportunities like the ease of adding new interactive services. To demonstrate the possibilities of XMPP on MHP, an IM client -IM4MHP- is presented in this paper

Asymmetric somatic plant hybridization : status and applications

To create asymmetric somatic hybrids, the genome of the so-called donor protoplast is fragmented prior to protoplast fusion. As a result, only a limited amount of the donor genome is transferred to the fusion product. This technique can circumvent some commonly observed problems related to symmetric fusion and offers a practical breeding tool for asexual hybridization. Genomes are typically fragmented by irradiation, microprotoplast production or application of metabolic inhibitors such as iodoacetamide. Irradiation and microprotoplast production fragment the nuclear genome, whereas iodoacetamide inactivates the cytoplasmic genome. It can therefore be used to introduce cytoplasmic male ste- rility, an important practical application. For hybrid verification and genome characterization, molecular markers and cytogenetic techniques are applied. This review highlights and discusses progress made during the last decade in sper- matophytes asymmetric protoplast fusion

Bringing troubled water: quality of experience in a mobile media context

The ICT environment went through notable changes, which have had an irreversible and strong influence on both ICT innovation processes and the role of end-users. In this context, technology developers are increasingly expected to take users’ experiences with technology into account during the process of developing applications or frameworks. As technology is more and more embedded in users’ daily lives, they seek out those personalized values to satisfy their own, situational needs. As a result, a thorough insight in users’ expectations and experiences at various levels (both explicit and more latent) and in different contexts (eg. mobile) has become a crucial determinant for the successful development, introduction and adoption of new ICTs. To this end, our paper focuses on the increased importance of Quality of Experience (QoE). It provides a conceptual model for QoE and furthermore discusses the prevalent gap that still exists between QoE and Quality of Service (QoS). Our main objective is to present a new methodology for correlating user experience to QoS parameters. This methodology was tested in the context of an exploratory interdisciplinary study on QoE-measurement. This new approach goes beyond QoS-parameters and aims to also grasp the social and contextual dimensions of users’ experiences

Online Matching with Set Delay

We initiate the study of online problems with set delay, where the delay cost at any given time is an arbitrary function of the set of pending requests. In particular, we study the online min-cost perfect matching with set delay (MPMD-Set) problem, which generalises the online min-cost perfect matching with delay (MPMD) problem introduced by Emek et al. (STOC 2016). In MPMD, $m$ requests arrive over time in a metric space of $n$ points. When a request arrives the algorithm must choose to either match or delay the request. The goal is to create a perfect matching of all requests while minimising the sum of distances between matched requests, and the total delay costs incurred by each of the requests. In contrast to previous work we study MPMD-Set in the non-clairvoyant setting, where the algorithm does not know the future delay costs. We first show no algorithm is competitive in $n$ or $m$. We then study the natural special case of size-based delay where the delay is a non-decreasing function of the number of unmatched requests. Our main result is the first non-clairvoyant algorithms for online min-cost perfect matching with size-based delay that are competitive in terms of $m$. In fact, these are the first non-clairvoyant algorithms for any variant of MPMD. Furthermore, we prove a lower bound of $\Omega(n)$ for any deterministic algorithm and $\Omega(\log n)$ for any randomised algorithm. These lower bounds also hold for clairvoyant algorithms

Online Matching with Set and Concave Delays

We initiate the study of online problems with set delay, where the delay cost at any given time is an arbitrary function of the set of pending requests. In particular, we study the online min-cost perfect matching with set delay (MPMD-Set) problem, which generalises the online min-cost perfect matching with delay (MPMD) problem introduced by Emek et al. (STOC 2016). In MPMD, m requests arrive over time in a metric space of n points. When a request arrives the algorithm must choose to either match or delay the request. The goal is to create a perfect matching of all requests while minimising the sum of distances between matched requests, and the total delay costs incurred by each of the requests. In contrast to previous work we study MPMD-Set in the non-clairvoyant setting, where the algorithm does not know the future delay costs. We first show no algorithm is competitive in n or m. We then study the natural special case of size-based delay where the delay is a non-decreasing function of the number of unmatched requests. Our main result is the first non-clairvoyant algorithms for online min-cost perfect matching with size-based delay that are competitive in terms of m. In fact, these are the first non-clairvoyant algorithms for any variant of MPMD. A key technical ingredient is an analog of the symmetric difference of matchings that may be useful for other special classes of set delay. Furthermore, we prove a lower bound of ?(n) for any deterministic algorithm and ?(log n) for any randomised algorithm. These lower bounds also hold for clairvoyant algorithms. Finally, we also give an m-competitive deterministic algorithm for uniform concave delays in the clairvoyant setting