Understanding the impact of line-of-sight in the ergodic spectral efficiency of cellular networks

In this paper we investigate the impact of lineof-sight (LoS) condition in the ergodic spectral efficiency of cellular networks. To achieve this goal, we have considered the kappa-mu shadowed model, which is a general model that provides an excellent fit to a wide set of propagation conditions. To overcome the mathematical complexity of the analysis, we have split the analysis between large and small-scale effects. Building on the proposed framework, we study a number of scenarios that range from heavily-fluctuating LoS to deterministic-LoS. Finally, we shed light on the interplay between fading severity and spectral efficiency by means of the amount of fading.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Trabajo Virtual en CEMEX: Coordinacion de Personas y Tecnologias

CEMEX developed a Virtual Work Model (VWM) to facilitate the execution of its acquisition-based strategy, when working in geographically dispersed teams using different time zones. The objective of our research case study is to prove the benefits of this virtual work model in CEMEX, particularly applied to the management of business knowledge for the successful integration of the acquired companies. The paper proposes a research model which identifies the enabling components for the creation of economic, pragmatic and symbolic value in virtual organizations. The variables considered in our research belong to the enabling, implementation and sustainability phases of the model. The selected methodology was case study research, using interviews and surveys as instruments for the field research. The results obtained from this research offer tangible and intangible benefits for the organization when using the VWM

Counting Arithmetical Structures on Paths and Cycles

Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d, r such that (diag (d) - A) r=0 , where A is the adjacency matrix of G. We investigate the combinatorics of arithmetical structures on path and cycle graphs, as well as the associated critical groups (the torsion part of the cokernels of the matrices (diag (d) - A)). For paths, we prove that arithmetical structures are enumerated by the Catalan numbers, and we obtain refined enumeration results related to ballot sequences. For cycles, we prove that arithmetical structures are enumerated by the binomial coefficients ((2n-1)/(n-1)) , and we obtain refined enumeration results related to multisets. In addition, we determine the critical groups for all arithmetical structures on paths and cycles

Cooperative tasks between humans and robots in industrial environments

Collaborative tasks between human operators and robotic manipulators can improve the performance and flexibility of industrial environments. Nevertheless, the safety of humans should always be guaranteed and the behaviour of the robots should be modified when a risk of collision may happen. This paper presents the research that the authors have performed in recent years in order to develop a human-robot interaction system which guarantees human safety by precisely tracking the complete body of the human and by activating safety strategies when the distance between them is too small. This paper not only summarizes the techniques which have been implemented in order to develop this system, but it also shows its application in three real human-robot interaction tasks.The research leading to these results has received funding from the European Communityʹs Seventh Framework Programme (FP7/2007‐2013) under Grant Agreement no. 231640 and the project HANDLE. This research has also been supported by the Spanish Ministry of Education and Science through the research project DPI2011‐22766

Counting Arithmetical Structures on Paths and Cycles

Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d, r such that (diag (d) - A) r=0 , where A is the adjacency matrix of G. We investigate the combinatorics of arithmetical structures on path and cycle graphs, as well as the associated critical groups (the torsion part of the cokernels of the matrices (diag (d) - A)). For paths, we prove that arithmetical structures are enumerated by the Catalan numbers, and we obtain refined enumeration results related to ballot sequences. For cycles, we prove that arithmetical structures are enumerated by the binomial coefficients ((2n-1)/(n-1)) , and we obtain refined enumeration results related to multisets. In addition, we determine the critical groups for all arithmetical structures on paths and cycles