Abstract

Abstract
The IP Multimedia Subsystem (IMS), standardized by 3GPP, can be seen as a way of offering Internet services, such as the Web access, electronic mail or instant messaging, through any access technology, in terms of terminals and networks. This paper presents a proposal to solve the problem of the dynamic adaptation of multimedia services provided in the Web context. The proposed solution is based on the real-time generation of user interfaces conditioned by the user context. The solution is mainly characterized by the approach used for resolving the existing dependencies among user interface variables and by the mechanism for acquiring the user context information, which uses the Parlay middleware.

Abstract
The integration of multiple network access technologies in the terminal is one of the most important trends in 4G networks. This integration places telecommunications service providers, and in particular operators, under the significant challenge of being able to transform their services in order to adapt them to a great variety of delivery contexts. This paper describes a generic methodology for the adaptation of telecommunications services provided in the context of an operator. A number of scenarios are examined which show how Parlay middleware can be used by trusted service providers to easily access network resources and context information for enhancing location-based and adaptable multimedia telecommunications services.

Abstract
This paper presents the results of a CMOS-VLSI implementation of a realistic computational model proposed by Walter Freeman for the olfactory system. This model, in later years, has been studied for engineering applications such as auto-association and classification. The analogue nature of the model motivates analogue VLSI implementations. However, the dimension and complexity of such system poses many obstacles to an analogue electronic implementation; one such is the massive interconnectivity which size increases with the square of the number of inputs (channels). We suggest a multiplexing procedure that puts the burden of interconnectivity over a digital system that is simpler to design and makes the analogue system more treatable. The procedure naturally samples the signals. To avoid smoothing filters, a discrete-time solution was also employed. Although with such approach the time resolution is reduced, the advantages overcome the detriments. Previous work has shown that the model can be efficiently discretized using DSP techniques, resulting on a system that is able to predict, on sample-by-sample basis, the behaviour of the VLSI circuit, allowing for a simple and flexible way to adjust the circuit parameters. We present the measured circuit results that are further confronted with the digital implementation.

Abstract
Byte stuffing is a technique to allow the transparent transmission of arbitrary sequences with constrained sequences. To date, most of the existing algorithms, such as PPP, attain a low average overhead by sacrificing the worst-case scenario. An exception is COBS which was designed for a low worst-case overhead; however, it imposes always a nonzero overhead, even on small packets. In this work is proposed a byte stuffing algorithm that simultaneously controls the average and worst-case overhead, performing close to the theoretical bound. It is shown analytically that the proposed algorithm achieves improved average and worst-case rates over state of the art methods. Furthermore, this technique is generalized to hybrid methods, with lower computing complexity. It is further analysed and compared experimentally the behaviour of the proposed algorithm against established algorithms in terms of byte overhead and computational time.

Abstract
Classification of ordinal data is one of the most important tasks of relation learning. This paper introduces a new machine learning paradigm specifically intended for classification problems where the classes have a natural order. The technique reduces the problem of classifying ordered classes to the standard two-class problem. The introduced method is then mapped into support vector machines and neural networks. Generalization bounds of the proposed ordinal classifier are also provided. An experimental study with artificial and real data sets, including an application to gene expression analysis, verifies the usefulness of the proposed approach.