Resultados de la búsqueda176 resultados

El Organismo de Inspección de Túneles de Bizkaia, experiencias de sus dos años de funcionamiento
MARTÍNEZ PLUMÉ, JAVIER; ZURINAGA COBEAGA, JAVIER
(2010). Participació en congressos 
Low cost identification applications in traffic vehicular environments
Segura García, Jaume. Soriano García, Francisco R
(2010). LlibreFrequency Identification Fundamentals and Applications.
ISBN: 9789537619749 
Dealing with Traffic information and User Profiles: a Semantic Approach Based on DATEX II.
Martínez Durá, Juan Jósé. Samper Zapater, Jose Javier. Torres Garrigós, David.
(2010). LlibreMechatronics Systems: Intelligent Transportation Vehicles.
ISBN: 9781608050819 
ECT'10: A New Approach to the Management of the Setting out in Construction Based on Augmented Reality Techniques
Gimeno, Jesús; Riera, Jose V.; Morillo, Pedro; Fernández, Marcos
(2010). ArticleThe setting out is the first step of construction of any building. This complex task used to be performed by means of specialized and expensive surveying equipment in order to minimize the deviation of the constructed areas from the information provided by design plans. This paper presents a new lowcost system oriented to the management of setting out in construction sites based on Augmented Reality technology. In this context, Augmented Reality allows surveying technicians to enhance the user’s view of the realworld with visual information provided by virtual objects. The proposed system consists of an Augmented Reality application connected to a hardware platform based on commercial...
The setting out is the first step of construction of any building. This complex task used to be performed by means of specialized and expensive surveying equipment in order to minimize the deviation of the constructed areas from the information provided by design plans. This paper presents a new lowcost system oriented to the management of setting out in construction sites based on Augmented Reality technology. In this context, Augmented Reality allows surveying technicians to enhance the user’s view of the realworld with visual information provided by virtual objects. The proposed system consists of an Augmented Reality application connected to a hardware platform based on commercial offtheshelf (COTS) components. The results of the proposed experiments show that the presented approach can be considered an efficient quality/cost tradeoff for setting out purposes in actual construction sit
Leer másOcultar 
Clustering Techniques for Grouping Traffic Events.
DEL CAMPO ROMERO, SILVIA; MARTÍNEZ DURÁ, JUAN JOSÉ; SAMPER ZAPATER, JOSÉ JAVIER;
(2010). LlibreMechatronics Systems: Intelligent Transportation Vehicles.
ISBN: 9781608050819 
Planejamento Estratégico de TIC em um Centro de Processamento de Dados de uma Universidade Brasileira
Samper Zapater, José Javier; Kira, L.M.B.; Nascimento, Rogerio P.C. do
(2010). Article 
Building of a Motion Feedback Roller Coaster Simulatior: a Case Study
Expósito, Sánchez, M. A.; García fernández, I.; Gamón, M. A.; Pla castells, M.; Martínez Durá, R. J.
(2010). ArticlePROC OF ISC. 2010.

Modelling and Simulation of Several Interacting Cellular Automata
Pla Castells, M.; García Fernández, I.; Martínez Durá, R. J.
(2010). ArticlePROC. OF ISC. 2010. Cellular Automata are used for modelling and simulation of many systems. In some applications, the system is formed by a set of subsystems that can be modelled separately, but, in such cases, the existence of interactions between these subsystems requires additional modelling and computer programming. In this paper we propose a modelling methodology for the simulation of a set of Cellular Automata models that interact with each other. The modelling methodology is described, together with an insight on implementation details. Also, it is applied to a particular Cellular Automata model, the Sanpile Model, to illustrate its use and to obtain some example simulations.

Accelerating consensus gossip algorithms: Sparsifying networks can be good for you
Asensio, C.; BeferullLozano, B.
(2010). ArticleIn this paper, we consider the problem of improving the convergence speed of an average consensus gossip algorithm by sparsifying a sufficiently dense network graph. Thus, instead of adding links, as usually proposed in the literature, or globally optimizing the mixing matrix of the gossip algorithm for a given network, which requires global knowledge at every node, we find a sparser network that has better spectral properties and faster convergence than the original denser one. This allows to reduce simultaneously both the convergence time and the communication cost involved in the execution of the gossip algorithm. We first show why it is possible to sparsify a network while increasing...
In this paper, we consider the problem of improving the convergence speed of an average consensus gossip algorithm by sparsifying a sufficiently dense network graph. Thus, instead of adding links, as usually proposed in the literature, or globally optimizing the mixing matrix of the gossip algorithm for a given network, which requires global knowledge at every node, we find a sparser network that has better spectral properties and faster convergence than the original denser one. This allows to reduce simultaneously both the convergence time and the communication cost involved in the execution of the gossip algorithm. We first show why it is possible to sparsify a network while increasing its convergence rate and also that there exists an optimal fraction of links to be removed. As a benchmark, we devise a centralized method that selects in an optimal way the set of links to be removed from the original network. Then, we propose a low complexity and scalable decentralized protocol requiring only local information at each node, which also generates a sparser network having a substantially better convergence rate. Simulation results are presented to verify and show clearly the efficiency of our approach.
Leer másOcultar 
Finding Sparse Connectivity Patterns in PowerConstrained Adhoc Networks for accelerating consensus algorithms
Asensio, C.; BeferullLozano, B.
(2010). ArticleIn this paper, we show how to critically sparsify a given network while improving the convergence rate of the associated average consensus algorithm. Thus, instead of adding new links or reallocating them, we propose novel distributed methods to nd much sparser networks with better convergence results than the original denser ones. We propose two distributed algorithms; a) in the first one, each node solves a local optimization problem using only its twohop neighborhood, b) the second one is a distributed algorithm based on using, at each node, the power method. As compared with previous work, the reduction in the number of active links is doubled while improving the convergence rate and...
In this paper, we show how to critically sparsify a given network while improving the convergence rate of the associated average consensus algorithm. Thus, instead of adding new links or reallocating them, we propose novel distributed methods to nd much sparser networks with better convergence results than the original denser ones. We propose two distributed algorithms; a) in the first one, each node solves a local optimization problem using only its twohop neighborhood, b) the second one is a distributed algorithm based on using, at each node, the power method. As compared with previous work, the reduction in the number of active links is doubled while improving the convergence rate and having a much lower power consumption. Simulation results are presented to verify and show clearly the eciency of our approach.
Leer másOcultar