Departament d'Enginyeria Telemàtica
http://hdl.handle.net/2117/1934
20170118T20:34:25Z

Almost IPPcodes or provably secure digital fingerprinting codes
http://hdl.handle.net/2117/98229
Almost IPPcodes or provably secure digital fingerprinting codes
Fernández Muñoz, Marcel; Kabatiansky, Grigory; Moreira Sánchez, José
Codes with the Identifiable Parent Property (IPP codes) form a very useful tool in traitor tracing schemes since they guarantee (with probability 1) identification of at least one of the traitors. We consider a natural generalization of IPP codes, namely codes for which this property holds with probability close to 1. A probabilistic
version of the IPP problem has been studied under the name of collusionsecure digital fingerprinting codes. We point out that, somewhat surprisingly, fingerprinting codes do no automatically have the 'almost IPP property.' © 2015 IEEE.
20161214T14:31:36Z
Fernández Muñoz, Marcel
Kabatiansky, Grigory
Moreira Sánchez, José
Codes with the Identifiable Parent Property (IPP codes) form a very useful tool in traitor tracing schemes since they guarantee (with probability 1) identification of at least one of the traitors. We consider a natural generalization of IPP codes, namely codes for which this property holds with probability close to 1. A probabilistic
version of the IPP problem has been studied under the name of collusionsecure digital fingerprinting codes. We point out that, somewhat surprisingly, fingerprinting codes do no automatically have the 'almost IPP property.' © 2015 IEEE.

An approach to the cooperative management of multitechnology networks
http://hdl.handle.net/2117/98225
An approach to the cooperative management of multitechnology networks
Díaz, R; Serrat Fernández, Juan; Berdekas, K; Karayannis, F
This article presents a TMNcompliant X interface, the socalled Xcoop interface, as a fundamental component of an operations system developed to cope with the challenges of multidomain, multitechnology networks. Defined at the network level, between operations systems of different TMN domains, it is intended as a support for the management of broadband connectivity services with endtoend QoS and scheduling constraints in backbones operated by many network operators. The key feature of the present approach, distinguishing it from other existing Xcoop solutions, is in handling the integrated ATM and SDH technologies, covering both the configuration management and fault management functional areas.
20161214T14:10:44Z
Díaz, R
Serrat Fernández, Juan
Berdekas, K
Karayannis, F
This article presents a TMNcompliant X interface, the socalled Xcoop interface, as a fundamental component of an operations system developed to cope with the challenges of multidomain, multitechnology networks. Defined at the network level, between operations systems of different TMN domains, it is intended as a support for the management of broadband connectivity services with endtoend QoS and scheduling constraints in backbones operated by many network operators. The key feature of the present approach, distinguishing it from other existing Xcoop solutions, is in handling the integrated ATM and SDH technologies, covering both the configuration management and fault management functional areas.

On the benefits of wireless SDN in networks of constrained edge devices
http://hdl.handle.net/2117/98164
On the benefits of wireless SDN in networks of constrained edge devices
Bestler, August; Quer, Ferran; Campus Mur, Daniel; Seyfettin Demirkol, Ilker; García Villegas, Eduard
In this paper we study the benefits of applying Software Defined Networking (SDN) to control forwarding in a network of constrained wireless edge devices. The proposed architecture is applicable to dense Small Cell deployments featuring wireless backhauling and edge computing capabilities, or to wirelessly connected sensor nodes following the fog computing paradigm. The paper introduces a novel path forwarding policy based on SDN, and presents an experimental evaluation demonstrating the benefits of the proposed policy to mitigate external interference, achieve flow balancing, and cope with CPU constrained devices.
20161213T14:55:23Z
Bestler, August
Quer, Ferran
Campus Mur, Daniel
Seyfettin Demirkol, Ilker
García Villegas, Eduard
In this paper we study the benefits of applying Software Defined Networking (SDN) to control forwarding in a network of constrained wireless edge devices. The proposed architecture is applicable to dense Small Cell deployments featuring wireless backhauling and edge computing capabilities, or to wirelessly connected sensor nodes following the fog computing paradigm. The paper introduces a novel path forwarding policy based on SDN, and presents an experimental evaluation demonstrating the benefits of the proposed policy to mitigate external interference, achieve flow balancing, and cope with CPU constrained devices.

MobilitApp: analysing mobility data of citizens in the metropolitan area of Barcelona
http://hdl.handle.net/2117/98006
MobilitApp: analysing mobility data of citizens in the metropolitan area of Barcelona
Puglisi, Silvia; Torres, Ángel; Marrugat, Gerard; Aguilar Igartua, Mónica; Forné Muñoz, Jorge
MobilitApp is a platform designed to provide smart mobility services in urban areas. It is designed to help citizens and transport authorities alike. Citizens will be able to access the MobilitApp mobile application and decide their optimal transportation strategy by visualising their usual routes, their carbon footprint, receiving tips, analytics and general mobility information, such as traffic and incident alerts. Transport authorities and service providers will be able to access information about the mobility pattern of citizens to offer their best services, improve costs and planning. The MobilitApp client runs on Android devices and records synchronously, while running in the background, periodic location updates from its users. The information obtained is processed and analysed to understand the mobility patterns of our users in the city of Barcelona, Spain.
20161212T13:10:44Z
Puglisi, Silvia
Torres, Ángel
Marrugat, Gerard
Aguilar Igartua, Mónica
Forné Muñoz, Jorge
MobilitApp is a platform designed to provide smart mobility services in urban areas. It is designed to help citizens and transport authorities alike. Citizens will be able to access the MobilitApp mobile application and decide their optimal transportation strategy by visualising their usual routes, their carbon footprint, receiving tips, analytics and general mobility information, such as traffic and incident alerts. Transport authorities and service providers will be able to access information about the mobility pattern of citizens to offer their best services, improve costs and planning. The MobilitApp client runs on Android devices and records synchronously, while running in the background, periodic location updates from its users. The information obtained is processed and analysed to understand the mobility patterns of our users in the city of Barcelona, Spain.

Multisided patches
http://hdl.handle.net/2117/97925
Multisided patches
Pla García, Núria; Vigo Anglada, Marc; Cotrina Navau, Josep
We present a method to construct a patch of parametric surface of degree k + 1 that lls a nsided hole, with n bigger than 2, and whose boundary coincides with a BSpline, thus, the resulting patch can be easily connected with given BSpline surfaces with xed continuity conditions. The method is inspired on a generic approach to construct free form surfaces, which gives a family of practical schemes to design surfaces from an arbitrary given mesh, using the di erentiable manifold theory. The input is a star shaped mesh which describes a generic nhole and a surface in a neighborhood of the hole. The main advantages of the method are the following: arbitrary order k continuity conditions can be imposed; the involved hole can have an arbitrary number of sides and arbitrary shape (convex or not); the simplicity of the construction process gives an easy and exible method; and nally, the surface near the boundary is a BSpline with piecewise uniform knot sequences and whose control points are vertices of the given mesh; both knot sequences and control points are easily computed. Implementation details to evaluate a surface point are given, showing that the de Boor algorithm can be exploited for efficiency.
20161209T10:50:42Z
Pla García, Núria
Vigo Anglada, Marc
Cotrina Navau, Josep
We present a method to construct a patch of parametric surface of degree k + 1 that lls a nsided hole, with n bigger than 2, and whose boundary coincides with a BSpline, thus, the resulting patch can be easily connected with given BSpline surfaces with xed continuity conditions. The method is inspired on a generic approach to construct free form surfaces, which gives a family of practical schemes to design surfaces from an arbitrary given mesh, using the di erentiable manifold theory. The input is a star shaped mesh which describes a generic nhole and a surface in a neighborhood of the hole. The main advantages of the method are the following: arbitrary order k continuity conditions can be imposed; the involved hole can have an arbitrary number of sides and arbitrary shape (convex or not); the simplicity of the construction process gives an easy and exible method; and nally, the surface near the boundary is a BSpline with piecewise uniform knot sequences and whose control points are vertices of the given mesh; both knot sequences and control points are easily computed. Implementation details to evaluate a surface point are given, showing that the de Boor algorithm can be exploited for efficiency.

A geographical heuristic routing protocol for VANETs
http://hdl.handle.net/2117/97905
A geographical heuristic routing protocol for VANETs
Urquiza Aguiar, Luis; Tripp Barba, Carolina; Aguilar Igartua, Mónica
Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, DelayTolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in nonsafety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a localsearch. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabusearch metaheuristics, which have largely been used to improve localsearch results in discrete optimization. We include a complete performance evaluation of GHR in a multihop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation).
20161207T17:39:33Z
Urquiza Aguiar, Luis
Tripp Barba, Carolina
Aguilar Igartua, Mónica
Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, DelayTolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in nonsafety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a localsearch. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabusearch metaheuristics, which have largely been used to improve localsearch results in discrete optimization. We include a complete performance evaluation of GHR in a multihop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation).

La espectroscopía raman aplicada a la identificación de materiales pictóricos
http://hdl.handle.net/2117/97876
La espectroscopía raman aplicada a la identificación de materiales pictóricos
Ruiz Moreno, Sergio; Yúfera Gomez, José Manuel; Soneira Ferrando, M. José; Breitman Mansilla, Mónica Celia; Morillo Bosch, M. Paz; Gràcia Rivas, Ignacio
20161207T14:46:16Z
Ruiz Moreno, Sergio
Yúfera Gomez, José Manuel
Soneira Ferrando, M. José
Breitman Mansilla, Mónica Celia
Morillo Bosch, M. Paz
Gràcia Rivas, Ignacio

Nsided patches with Bspline boundaries
http://hdl.handle.net/2117/97827
Nsided patches with Bspline boundaries
Cotrina Navau, Josep; Pla García, Núria; Vigo Anglada, Marc
We present a method to construct a patch of parametric surface of
degree k+1 that fills a nsided hole, with bigger than 2, and whose
boundary coincides with a BSpline, thus, the resulting patch can be
easily connected with given BSpline surfaces with fixed continuity
conditions. The method is based on the generic approach by the same
authors to construct free form surfaces, which gives a family of
practical schemes to design surfaces from an arbitrary given mesh,
using the differentiable manifold theory. The proposal uses a star
shaped mesh which describes a generic nhole and a surface in a
neighborhood of the hole. From this mesh, a set of charts is defined,
one associated to each vertex or face of the mesh, depending on the
parity of the input parameter k. A basis function and a control point
is defined from each chart, and the surface is obtained as a
baricentric combination of the control points using the defined basis
functions. The main advantages of the method are the following:
arbitrary order k continuity conditions can be imposed; the involved
hole can have an arbitrary number of sides and arbitrary shape (convex
or not) the simplicity of the construction process gives an easy and
flexible method; and finally, the surface near the boundary is a
BSpline with piecewise uniform knot sequences and whose control
points are vertices of the given mesh. Implementation details to
evaluate a surface point are given, showing that the de Boor algorithm
can be exploited for efficiency.
20161207T10:03:03Z
Cotrina Navau, Josep
Pla García, Núria
Vigo Anglada, Marc
We present a method to construct a patch of parametric surface of
degree k+1 that fills a nsided hole, with bigger than 2, and whose
boundary coincides with a BSpline, thus, the resulting patch can be
easily connected with given BSpline surfaces with fixed continuity
conditions. The method is based on the generic approach by the same
authors to construct free form surfaces, which gives a family of
practical schemes to design surfaces from an arbitrary given mesh,
using the differentiable manifold theory. The proposal uses a star
shaped mesh which describes a generic nhole and a surface in a
neighborhood of the hole. From this mesh, a set of charts is defined,
one associated to each vertex or face of the mesh, depending on the
parity of the input parameter k. A basis function and a control point
is defined from each chart, and the surface is obtained as a
baricentric combination of the control points using the defined basis
functions. The main advantages of the method are the following:
arbitrary order k continuity conditions can be imposed; the involved
hole can have an arbitrary number of sides and arbitrary shape (convex
or not) the simplicity of the construction process gives an easy and
flexible method; and finally, the surface near the boundary is a
BSpline with piecewise uniform knot sequences and whose control
points are vertices of the given mesh. Implementation details to
evaluate a surface point are given, showing that the de Boor algorithm
can be exploited for efficiency.

A hybridarq system for hf channels based on codeword partitioning
http://hdl.handle.net/2117/97779
A hybridarq system for hf channels based on codeword partitioning
Serrat Fernández, Juan; Dalmau, J Royo
A technique by which the codewords of an errorcorrecting code are partitioned to obtain an errordetecting code with half the original length is described. It is intended to be used in a hybridARQ system for achieving high throughput on HF channels. Performance evaluations of examples based on BCH and RS codes are also provided
20161205T13:45:47Z
Serrat Fernández, Juan
Dalmau, J Royo
A technique by which the codewords of an errorcorrecting code are partitioned to obtain an errordetecting code with half the original length is described. It is intended to be used in a hybridARQ system for achieving high throughput on HF channels. Performance evaluations of examples based on BCH and RS codes are also provided

Towards free form surfaces
http://hdl.handle.net/2117/97654
Towards free form surfaces
Cotrina Navau, Josep; Pla García, Núria; Vigo Anglada, Marc
A theoretical approach to construct free form surfaces is presented. We
develop the conceps that arise when a free form surface is generated by
tracing a mesh, using differentiable manifold theory, and generalizing
the Bspline scheme. This approach allows to define a family of
practical schemes.
20161201T18:18:08Z
Cotrina Navau, Josep
Pla García, Núria
Vigo Anglada, Marc
A theoretical approach to construct free form surfaces is presented. We
develop the conceps that arise when a free form surface is generated by
tracing a mesh, using differentiable manifold theory, and generalizing
the Bspline scheme. This approach allows to define a family of
practical schemes.