Locally linear approximation for Kernel methods : the Railway Kernel

In this paper we present a new kernel, the Railway Kernel, that works properly for general (nonlinear) classification problems, with the interesting property that acts locally as a linear kernel. In this way, we avoid potential problems due to the use of a general purpose kernel, like the RBF kernel, as the high dimension of the induced feature space. As a consequence, following our methodology the number of support vectors is much lower and, therefore, the generalization capability of the proposed kernel is higher than the obtained using RBF kernels. Experimental work is shown to support the theoretical issues

Rejoinder to "Support Vector Machines with Applications"

Rejoinder to ``Support Vector Machines with Applications'' [math.ST/0612817]Comment: Published at http://dx.doi.org/10.1214/088342306000000501 in the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org

Representing functional data in reproducing Kernel Hilbert Spaces with applications to clustering and classification

Functional data are difficult to manage for many traditional statistical techniques given their very high (or intrinsically infinite) dimensionality. The reason is that functional data are essentially functions and most algorithms are designed to work with (low) finite-dimensional vectors. Within this context we propose techniques to obtain finitedimensional representations of functional data. The key idea is to consider each functional curve as a point in a general function space and then project these points onto a Reproducing Kernel Hilbert Space with the aid of Regularization theory. In this work we describe the projection method, analyze its theoretical properties and propose a model selection procedure to select appropriate Reproducing Kernel Hilbert spaces to project the functional data.Functional data, Reproducing, Kernel Hilbert Spaces, Regularization theory

A Security Pattern for Cloud service certification

Cloud computing is interesting from the economic, operational and even energy consumption perspectives but it still raises concerns regarding the security, privacy, governance and compliance of the data and software services offered through it. However, the task of verifying security properties in services running on cloud is not trivial. We notice the provision and security of a cloud service is sensitive. Because of the potential interference between the features and behavior of all the inter-dependent services in all layers of the cloud stack (as well as dynamic changes in them). Besides current cloud models do not include support for trust-focused communication between layers. We present a mechanism to implement cloud service certification process based on the usage of Trusted Computing technology, by means of its Trusted Computing Platform (TPM) implementation of its architecture. Among many security security features it is a tamper proof resistance built in device and provides a root of trust to affix our certification mechanism. We present as a security pattern the approach for service certification based on the use TPM.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tec

Improving Fixed-Point Implementation of QR Decomposition by Rounding-to-Nearest

QR decomposition is a key operation in many current communication systems. This paper shows how to reduce the area of a fixed-point QR decomposition implementation based on Givens rotations by using a new number representation system. This new representation allows performing round-tonearest at the same cost of truncation. Consequently, the rounding errors of the results are halved, which allows it to reduce the word-length by one bit. This reduction positively impacts on the area, delay and power consumption of the design.Ministry of Education and Science of Spain and Junta of Andalucía under contracts TIN2013-42253-P and TIC-1692, respectively, and Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Sociología: ciencia, política e ideología en el cruce de entresiglos

En el presente trabajo pretendemos recoger una serie de ideas y reflexiones acerca del estado actual de la teoría sociológica, buscando ubicar a las diferentes perspectivas y enfoques predominantes en el análisis de lo social. La realización de este ejercicio, pretendemos que sea de utilidad para trazar una especie de mapa intelectual que nos ayude a distinguir los distintos niveles y planos desde los que se construye el universo del razonamiento sociológico y su situación en el terreno de la geopolítica y del debate ideológico que con frecuencia contamina el quehacer sociológico

Short-range stationary patterns and long-range disorder in an evolution equation for one-dimensional interfaces

A novel local evolution equation for one-dimensional interfaces is derived in the context of erosion by ion beam sputtering. We present numerical simulations of this equation which show interrupted coarsening in which an ordered cell pattern develops with constant wavelength and amplitude at intermediate distances, while the profile is disordered and rough at larger distances. Moreover, for a wide range of parameters the lateral extent of ordered domains ranges up to tens of cells. This behavior is new in the context of dynamics of surfaces or interfaces with morphological instabilities. We also provide analytical estimates for the stationary pattern wavelength and mean growth velocity