Editorial -Special issue on adaptive multimedia computing

In recent years, there is an emerging research area in multimedia computing, with the increasing number of related work in scalable video, adaptive multimedia documents, adaptive multimedia services, to name just a few. This new trend comes about partly due to the increasing use of mobile media devices where media requirements could change among users and devices and at different times of reception or presentation, and partly due to the changing network conditions, where best-effort service is the general practice. Any change in Quality of Services (QoS) could imply a change in the delivery or scheduling of media contents. To complicate the matter, user interruptions or requirement changes during the communication process could also occur; for example, a user may not be satisfied with the current media quality and decide an upgrade in real time. The status quo is that this new research paradigm is beginning to take shape while no effort has been made to draw a roadmap for it. We could see some major research work missing, for example, formal methods or modeling of adaptive multimedi

Adaptive scheduling of multimedia documents

Multimedia presentations are applicable in various domains such as advertising, commercial presentations or education. Multimedia presentations are described by multimedia documents. The presentation of multimedia documents require vast system resources due to the huge amount of data that has to be transferred and processed by the computer system. If multimedia documents can be accessed on-line via different types of networks and be presented on various types of terminals, such as PCs or Set-Top-Units, different amounts of resources may be available at presentation time. Hence, it can happen that there are not enough resources to render a multimedia document according to the specification. For usual multimedia documents resource scarcity implies an arbitrarily reduced quality of the presentation or it can even be impossible to start or continue the presentation. To handle resource scarcity in a better way, multimedia documents can be specified flexible so that they can be adapted to different resource situations. Our temporal model provides abstractions to specify flexible multimedia documents on two levels. It is possible to specify multimedia documents with alternative presentation parts. Further on, the presentation behavior of media objects can vary within specified limits. Hence, the temporal model allows to compose presentations which have a defined behavior when resource restrictions occur. The presented adaptive scheduling algorithm uses the flexibility in specifications to adapt presentations at regular intervals to the current resource situation. Hence, the quality of presentations is reduced or increased in a defined manner

Specification and scheduling of adaptive multimedia documents

Multimedia documents are of importance in several application areas, such as education, training, advertising and entertainment. Since multimedia documents may comprise continuous media, such as audio and video, the presentation of those documents may require a significant amount of processing and network resources. The amount of resources available during a presentation depends on the system configuration and the current system load. Hence, it can happen that there are not enough resources to render a multimedia document according to the specification, resulting in a reduced presentation quality, if the presentation is possible at all. To cope with those situations, different versions of the same document can be specified, one for each potential configuration or probable load situation. A better approach is to have only one document that can be adapted to different system configurations and load conditions. To enable this approach, an adaptive document model as well as an adaptive scheduling algorithm are necessary. In this paper, we present the adaptive Tiempo document model, an algorithm to check the consistency of specifications, the concepts of a graphical document editor supporting the model as well as a scheduling algorithm which allows to adapt documents conform to our model in environments with best-effort assignment of resources

Inferring Temporal Behaviours Through Kernel Tracing

In order to provide reliable system support for real-time applications, it is often important to be able to collect statistics about the tasks temporal behaviours (in terms of execution times and inter-arrival times). Such statistics can, for example, be used to provide a-priori schedulability guarantees, or to perform some kind of on-line adaptation of the scheduling parameters (adaptive scheduling, or feedback scheduling). This work shows how the Linux kernel allows to collect such statistics by using an internal function tracer called Ftrace. Based on this feature, tools can be developed to evaluate the real-time performance of a system or an application, to debug real-time applications, and/or to infer the temporal properties (for example, periodicity) of tasks running in the system

The contribution of data mining to information science

The information explosion is a serious challenge for current information institutions. On the other hand, data mining, which is the search for valuable information in large volumes of data, is one of the solutions to face this challenge. In the past several years, data mining has made a significant contribution to the field of information science. This paper examines the impact of data mining by reviewing existing applications, including personalized environments, electronic commerce, and search engines. For these three types of application, how data mining can enhance their functions is discussed. The reader of this paper is expected to get an overview of the state of the art research associated with these applications. Furthermore, we identify the limitations of current work and raise several directions for future research

SMIL State: an architecture and implementation for adaptive time-based web applications

In this paper we examine adaptive time-based web applications (or presentations). These are interactive presentations where time dictates which parts of the application are presented (providing the major structuring paradigm), and that require interactivity and other dynamic adaptation. We investigate the current technologies available to create such presentations and their shortcomings, and suggest a mechanism for addressing these shortcomings. This mechanism, SMIL State, can be used to add user-defined state to declarative time-based languages such as SMIL or SVG animation, thereby enabling the author to create control flows that are difficult to realize within the temporal containment model of the host languages. In addition, SMIL State can be used as a bridging mechanism between languages, enabling easy integration of external components into the web application. Finally, SMIL State enables richer expressions for content control. This paper defines SMIL State in terms of an introductory example, followed by a detailed specification of the State model. Next, the implementation of this model is discussed. We conclude with a set of potential use cases, including dynamic content adaptation and delayed insertion of custom content such as advertisements. © 2009 Springer Science+Business Media, LLC

Supervised cross-modal factor analysis for multiple modal data classification

In this paper we study the problem of learning from multiple modal data for purpose of document classification. In this problem, each document is composed two different modals of data, i.e., an image and a text. Cross-modal factor analysis (CFA) has been proposed to project the two different modals of data to a shared data space, so that the classification of a image or a text can be performed directly in this space. A disadvantage of CFA is that it has ignored the supervision information. In this paper, we improve CFA by incorporating the supervision information to represent and classify both image and text modals of documents. We project both image and text data to a shared data space by factor analysis, and then train a class label predictor in the shared space to use the class label information. The factor analysis parameter and the predictor parameter are learned jointly by solving one single objective function. With this objective function, we minimize the distance between the projections of image and text of the same document, and the classification error of the projection measured by hinge loss function. The objective function is optimized by an alternate optimization strategy in an iterative algorithm. Experiments in two different multiple modal document data sets show the advantage of the proposed algorithm over other CFA methods

Prediction-Based Energy Saving Mechanism in 3GPP NB-IoT Networks

The current expansion of the Internet of things (IoT) demands improved communication platforms that support a wide area with low energy consumption. The 3rd Generation Partnership Project introduced narrowband IoT (NB-IoT) as IoT communication solutions. NB-IoT devices should be available for over 10 years without requiring a battery replacement. Thus, a low energy consumption is essential for the successful deployment of this technology. Given that a high amount of energy is consumed for radio transmission by the power amplifier, reducing the uplink transmission time is key to ensure a long lifespan of an IoT device. In this paper, we propose a prediction-based energy saving mechanism (PBESM) that is focused on enhanced uplink transmission. The mechanism consists of two parts: first, the network architecture that predicts the uplink packet occurrence through a deep packet inspection; second, an algorithm that predicts the processing delay and pre-assigns radio resources to enhance the scheduling request procedure. In this way, our mechanism reduces the number of random accesses and the energy consumed by radio transmission. Simulation results showed that the energy consumption using the proposed PBESM is reduced by up to 34% in comparison with that in the conventional NB-IoT method