The path: sustainable development in conjunction with meeting the demands of a changing environment.

In the context of severe economic recession, the Library is compelled to adapt to this changing environment, in order to meet the requirements and demands of users with very specific needs. Taking the pillars of sustainable development as a reference point, and extrapolating them to our domain, we establish the next main goals

Anonymous Routing Protocol in decentralized networks

Peer-reviewed

Secure Dynamic MANET On-demand (SEDYMO) Routing Protocol

This paper describes the state of the art of secure ad hoc routing protocols and presents SEDYMO, a mechanism to secure a dynamic multihop ad hoc routing protocol. The proposed solution defeats internal and external attacks usinga trustworthiness model based on a distributed certification authority. Digital signatures and hash chains are used to ensure the correctness of the protocol. The protocol is compared with other alternatives in terms of security strength, energy efficiency and time delay. Both computational and transmission costs are considered and it is shown that the secure protocol overhead is not a critical factor compared to the high network interface cost.

Identifying the Role of Final Consumption in Structural Path Analysis: An Application to Water Uses

The complexity of the connexions within an economic system can only be reliably reflected in academic research if powerful methods are used. Researchers have used Structural Path Analysis (SPA) to capture not only the linkages within the production system but also the propagation of the effects into different channels of impacts. However, the SPA literature has restricted itself to showing the relations among sectors of production, while the connections between these sectors and final consumption have attracted little attention. In order to consider the complete set of channels involved, in this paper we propose a structural path method that endogenously incorporates not only sectors of production but also the final consumption of the economy. The empirical application comprises water usages, and analyses the dissemination of exogenous impacts into various channels of water consumption. The results show that the responsibility for water stress is imputed to different sectors and depends on the hypothesis used for the role played by final consumption in the model. This highlights the importance of consumers’ decisions in the determination of ecological impacts. Keywords: Input-Output Analysis, Structural Path Analysis, Final Consumption, Water uses.

Dendrochronological study of the avalanche path Canal del Roc Roig: first results of the ALUDEX Project in the Pyrenees

Historical data about ancient avalanches are scarce in the Pyrenees. Dendrochronology can provide new data about past avalanches and their return period, but up to now little research has been carried out with this purpose. The Aludex project aims to obtain information about the frequency and extent of extreme avalanches, using a dendrochronological and a nivo-meteorological approach. In this paper, we present the results of a dendrochronological study of the Canal del Roc Roig avalanche path which was affected by two extreme avalanches in February 1996. This first dendrochronological study has permitted us to assess the tree-ring signals due to avalanche events in 53 out of 132 dated trees. The trees presented a variety of responses to the 1996 avalanche events. It is shown that the type of tree-ring signal depends on tree age. The methodology has proved successful in detecting the 1996 and 1972 documented avalanche events, and provided outstanding evidence of undocumented past events such as one in 1930.

Question Waves: A multicast query routing algorithm for social search

This paper describes Question Waves, an algorithm that can be applied to social search protocols, such as Asknext or Sixearch. In this model, the queries are propagated through the social network, with faster propagation through more trustable acquaintances. Question Waves uses local information to make decisions and obtain an answer ranking. With Question Waves, the answers that arrive first are the most likely to be relevant, and we computed the correlation of answer relevance with the order of arrival to demonstrate this result. We obtained correlations equivalent to the heuristics that use global knowledge, such as profile similarity among users or the expertise value of an agent. Because Question Waves is compatible with the social search protocol Asknext, it is possible to stop a search when enough relevant answers have been found; additionally, stopping the search early only introduces a minimal risk of not obtaining the best possible answer. Furthermore, Question Waves does not require a re-ranking algorithm because the results arrive sorted

A survey on coverage path planning for robotics

Coverage Path Planning (CPP) is the task of determining a path that passes over all points of an area or volume of interest while avoiding obstacles. This task is integral to many robotic applications, such as vacuum cleaning robots, painter robots, autonomous underwater vehicles creating image mosaics, demining robots, lawn mowers, automated harvesters, window cleaners and inspection of complex structures, just to name a few. A considerable body of research has addressed the CPP problem. However, no updated surveys on CPP reflecting recent advances in the field have been presented in the past ten years. In this paper, we present a review of the most successful CPP methods, focusing on the achievements made in the past decade. Furthermore, we discuss reported field applications of the described CPP methods. This work aims to become a starting point for researchers who are initiating their endeavors in CPP. Likewise, this work aims to present a comprehensive review of the recent breakthroughs in the field, providing links to the most interesting and successful works

Servei de rutes basat en Open Source Routing Machine

Aquesta memòria descriu la preparació, l'execució i els resultats obtinguts d'implementar un sistema calculador de rutes. El projecte Open Source Routing Machine és un motor calculador de rutes d'alt rendiment que utilitza les dades de OpenStreetMaps per calcular el camí més curt entre dos punts. En aquest projecte final no únicament es volen utilitzar les dades OpenStreetMap sinó que també es pretenen utilitzar dades pròpies en format shapefile i poder visualitzar-los en un visor web. Aquest visor permet a l'usuari, de forma senzilla, sol•licitar rutes al servidor OSRM creat, obtenint la ruta desitjada en molt pocs milisegons

Operational Cost Reduction in WDM Networks using Lighttours

Wavelength division multiplexing (WDM) networks have been adopted as a near-future solution for the broadband Internet. In previous work we proposed a new architecture, named enhanced grooming (G+), that extends the capabilities of traditional optical routes (lightpaths). In this paper, we compare the operational expenditures incurred by routing a set of demands using lightpaths with that of lighttours. The comparison is done by solving an integer linear programming (ILP) problem based on a path formulation. Results show that, under the assumption of single-hop routing, almost 15% of the operational cost can be reduced with our architecture. In multi-hop routing the operation cost is reduced in 7.1% and at the same time the ratio of operational cost to number of optical-electro-optical conversions is reduced for our architecture. This means that ISPs could provide the same satisfaction in terms of delay to the end-user with a lower investment in the network architecture

All-Optical Unicast/Multicast Routing in WDM Networks

Optical transport networks (OTN) must be prepared in terms of better resource utilization, for accommodating unicast and multicast traffic together. Light-trees have been proposed for supporting multicast connections in OTN. Nevertheless when traffic grooming is applied in light-trees, resources can be underutilized as traffic can be routed to undesirable destinations in order to avoid optical-electrical-optical (OEO) conversions. In this paper, a novel architecture named S/G light- tree for supporting unicast/multicast connections is proposed. The architecture allows traffic dropping and aggregation in different wavelengths without performing OEO conversions. A heuristic that routes traffic demands using less wavelengths by taking advantage of the proposed architecture is designed as well. Simulation results show that the architecture can minimize the number of used wavelengths and OEO conversions when compared to light-trees