473 research outputs found

    Análisis estadístico de los refugiados colombianos en el Ecuador según el proyecto registro ampliado

    Get PDF
    Esta investigación nació con el objetivo de analizar estadísticamente las características socio-económicas de los refugiados colombianos en el Ecuador y demostrar que la falta de garantías al derecho internacional humanitario es la principal causa para que los colombianos lleguen al Ecuador en búsqueda de protección internacional. Con la estadística recopilada, se pudo conocer que existieron flujos masivos de colombianos hacia el Ecuador en los años 2003 y 2009, la mayoría reside en la frontera norte, se logró distinguir que tanto hombres como mujeres entre los 18 y 29 años de edad son víctimas del conflicto colombiano. Hay colombianos provenientes de los departamentos del Putumayo, Nariño y Valle del Cauca, los mismos que están azotados por la violencia generalizada y que los colombianos o sus familias en el país de origen fueron intimidados, amenazados, masacrados o asesinados por distintos grupos irregulares. Las conclusiones y recomendaciones se basan en favor de la salud y contra la corrupción, extorsiones y abusos contra refugiados. Básicamente generar estadísticas nacionales desagregadas por sexo que permitan tener una mejor información sobre la situación de los refugiados colombianos.This research began with the objective to analyze statistically the socioeconomic characteristics of the Colombian refugees in Ecuador and demonstrate that lack of collateral at international human right is the principal reason to Colombians comes to Ecuador to find international protection. With statistics obtained, It´s known that a big number of Colombian people come to Ecuador in the years 2003 and 2009, most of them live on the northern border, it was reached distinguish that men as women among 18 and 29 years old are victims of the Colombian conflict. There are Colombians from Putumayo, Nariño and Valle del Cauca Departments, they are affected by the violence and their families in their origin country were intimidated, threatened, slaughtered or killed by irregular groups. The conclusions and recommendations are based on pro-health and anti-corruption, extortion and abuses against refugees. Basically it is to generate national statistics disaggregated by gender that let have better information about the situation of Colombian refugees

    Updating/downdating the NonNegative Matrix Factorization

    Full text link
    This is the author’s version of a work that was accepted for publication in Journal of Computational and Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Computational and Applied Mathematics 318 (2017) 59–68. DOI 10.1016/j.cam.2016.11.048.The Non-Negative Matrix Factorization (NNMF) is a recent numerical tool that, given a nonnegative data matrix, tries to obtain its factorization as the approximate product of two nonnegative matrices. Nowadays, this factorization is being used in many science fields; in some of these fields, real-time computation of the NNMF is required. In some scenarios, all data is not initially available and when new data (as new rows or columns) becomes available the NNMF must be recomputed. Recomputing the whole factorization every time is very costly and not suitable for real time applications. In this paper we propose several algorithms to update the NNMF factorization taking advantage of the previously computed factorizations, with similar error and lower computational cost. © 2016 Elsevier B.V. All rights reserved.This work has been partially supported by EU together with Spanish Government through TEC2015-67387-C4-1-R (MINECO/FEDER), by Generalitat Valenciana through PROMETEOII/2014/003 and by Programa de FPU del Ministerio de Educacion, Cultura y Deporte FPU13/03828 (Spain). We want to thank Dr. Pedro Vera and his team (University of Jaen) for providing us with their music analysis software.San Juan Sebastián, P.; Vidal Maciá, AM.; García Mollá, VM. (2016). Updating/downdating the NonNegative Matrix Factorization. Journal of Computational and Applied Mathematics. 318:59-68. https://doi.org/10.1016/j.cam.2016.11.048S596831

    Transparent network-assisted flow mobility for multimedia applications in IMS environments

    Get PDF
    Cellular network operators are striving to solve the problem caused by the increasing volume of traffic over their networks. Given the proliferation of multi-interface devices, offloading part of the traffic to available access networks (e. g., WiFi or 3G access networks, even from other operators) seems to be a promising alternative. Here, we propose an IMS-compatible solution for flow mobility between access networks that exhibits two key features: flow mobility is transparent to both local applications at mobile nodes and their communication peers (e. g., multimedia content servers), and mobility operations are assisted by the network, so the home network supports the terminal in the process of access network discovery, and provides the terminal with policies that meet visited and home operators' roaming agreements while optimizing the use of their networks. The proposed solution has been validated using a real IMS testbed with Ethernet and WiFi access networks, where the mobility of UDP and TCP flows has been tested.The work in this article has been partially granted by the Madrid Community through the MEDIANET project (S-2009/TIC-1468) and by the Celtic UP-TO-US project (TSI-020400-2010-114)Publicad

    On the relationship between optical variability, visual saliency, and eye fixations: a computational approach

    Get PDF
    A hierarchical definition of optical variability is proposed that links physical magnitudes to visual saliency and yields a more reductionist interpretation than previous approaches. This definition is shown to be grounded on the classical efficient coding hypothesis. Moreover, we propose that a major goal of contextual adaptation mechanisms is to ensure the invariance of the behavior that the contribution of an image point to optical variability elicits in the visual system. This hypothesis and the necessary assumptions are tested through the comparison with human fixations and state-of-the-art approaches to saliency in three open access eye-tracking datasets, including one devoted to images with faces, as well as in a novel experiment using hyperspectral representations of surface reflectance. The results on faces yield a significant reduction of the potential strength of semantic influences compared to previous works. The results on hyperspectral images support the assumptions to estimate optical variability. As well, the proposed approach explains quantitative results related to a visual illusion observed for images of corners, which does not involve eye movementsS

    Analysis of an efficient parallel implementation of active-set Newton algorithm

    Full text link
    [EN] This paper presents an analysis of an efficient parallel implementation of the active-set Newton algorithm (ASNA), which is used to estimate the nonnegative weights of linear combinations of the atoms in a large-scale dictionary to approximate an observation vector by minimizing the Kullback¿Leibler divergence between the observation vector and the approximation. The performance of ASNA has been proved in previous works against other state-of-the-art methods. The implementations analysed in this paper have been developed in C, using parallel programming techniques to obtain a better performance in multicore architectures than the original MATLAB implementation. Also a hardware analysis is performed to check the influence of CPU frequency and number of CPU cores in the different implementations proposed. The new implementations allow ASNA algorithm to tackle real-time problems due to the execution time reduction obtained.This work has been partially supported by Programa de FPU del MECD, by MINECO and FEDER from Spain, under the projects TEC2015-67387- C4-1-R, and by project PROMETEO FASE II 2014/003 of Generalitat Valenciana. The authors want to thank Dr. Konstantinos Drossos for some very useful mind changing discussions. This work has been conducted in Laboratory of Signal Processing, Tampere University of Technology.San Juan-Sebastian, P.; Virtanen, T.; García Mollá, VM.; Vidal Maciá, AM. (2018). Analysis of an efficient parallel implementation of active-set Newton algorithm. The Journal of Supercomputing. 75(3):1298-1309. https://doi.org/10.1007/s11227-018-2423-5S12981309753Raj B, Smaragdis P (2005) Latent variable decomposition of spectrograms for single channel speaker separation. In: Proceedings of the IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (WASPAA 2005), New Paltz, NyBertin N, Badeau R, Vincent E (2010) Enforcing harmonicity and smoothness in Bayesian non-negative matrix factorization applied to polyphonic music transcription. IEEE Trans Audio Speech Lang Process 18(3):538–549Dikmen O, Mesaros A (2013) Sound event detection using non-negative dictionaries learned from annotated overlapping events. In: IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (WASPAA 2013). New Paltz, NYLawson CL, Hanson RJ (1995) Solving least squares problems. Society for Industrial and Applied Mathematics, PhiladelphiaVirtanen T (2007) Monaural sound source separation by nonnegative matrix factorization with temporal continuity and sparseness criteria. IEEE Trans Audio Speech Lang Process 15(3):1066–1074Virtanen T, Gemmeke J, Raj B (2013) Active-set Newton algorithm for overcomplete non-negative representations of audio. IEEE Trans Audio Speech Lang Process 21(11):2277–2289Cemgil AT (2009) Bayesian inference for nonnegative matrix factorisation models. Comput Intell Neurosci 2009:785152Cichocki A, Zdunek R, Phan AH, Amari S (2009) Nonnegative matrix and tensor factorizations. Wiley, New YorkMATLAB (2014) The Mathworks Inc., MATLAB R2014B, Natnick MATuomas Virtanen, Original MATLAB implementation of ASNA algorithm. http://www.cs.tut.fi/~tuomasv/software.htmlCarabias-Orti J, Rodriguez-Serrano F, Vera-Candeas P, Canadas-Quesada F, Ruiz-Reyes N (2013) Constrained non-negative sparse coding using learnt instrument templates for realtime music transcription. Eng Appl Artif Intell 26:1671–1680San Juan P, Virtanen T, Garcia-Molla Victor M, Vidal Antonio M (2016) Efficient parallel implementation of active-set newton algorithm for non-negative sparse representations. In: 16th International Conference on Computational and Mathematical Methods in Science and Engineering (CMMSE 2016), Rota, SpainJuan P San, Efficient implementations of ASNA algorithm. https://gitlab.com/P.SanJuan/ASNAOpenMP v4.5 specification (2015). http://www.openmp.org/wpcontent/uploads/openmp-4.5.pdfGemmeke JF, Hurmalainen A, Virtanen T, Sun Y (2011) Toward a practical implementation of exemplar-based noise robust ASR. In: Signal Processing Conference, 19th European, IEEE, pp 1490–149

    Actitud hacia el product placement en los videojuegos para móviles

    Get PDF
    El uso del product placement, que surge como una herramienta alternativa a la publicidad tradicional, se ha aplicado a diferentes medios y soportes comunicativos. En los últimos años, y especialmente con el desarrollo de los smartphones, ha cobrado especial interés su aplicación a los videojuegos para móviles. Sin embargo, teniendo en cuenta que las características del smartphone son diferentes a las de otros medios o soportes de product placement (televisión, cine, videojuegos tradicionales), se considera interesante analizar qué efecto produce en el consumidor o usuario de dichos dispositivos. Es por ello que, como objetivo principal de este trabajo, se analiza la actitud de los usuarios hacia el product placement en los videojuegos para móviles inteligentes.Centro Universitario de la Defensa. Escuela de Turismo de Cartagena. Escuela Técnica Superior de Ingeniería Industrial UPCT. Escuela Técnica Superior de Ingeniería de Telecomunicación (ETSIT). Escuela de Ingeniería de Caminos y Minas (EICM). Escuela de Arquitectura e Ingeniería de Edificación (ARQ&IDE). Parque Tecnológico de Fuente Álamo. Navantia. Campus Mare Nostrum. Estación Experimental Agroalimentaria Tomás Ferr

    Super-Planckian far-field radiative heat transfer

    Full text link
    We present here a theoretical analysis that demonstrates that the far-field radiative heat transfer between objects with dimensions smaller than the thermal wavelength can overcome the Planckian limit by orders of magnitude. To guide the search for super-Planckian far-field radiative heat transfer, we make use of the theory of fluctuational electrodynamics and derive a relation between the far-field radiative heat transfer and the directional absorption efficiency of the objects involved. Guided by this relation, and making use of state-of-the-art numerical simulations, we show that the far-field radiative heat transfer between highly anisotropic objects can largely overcome the black-body limit when some of their dimensions are smaller than the thermal wavelength. In particular, we illustrate this phenomenon in the case of suspended pads made of polar dielectrics like SiN or SiO2. These structures are widely used to measure the thermal transport through nanowires and low-dimensional systems and can be employed to test our predictions. Our work illustrates the dramatic failure of the classical theory to predict the far-field radiative heat transfer between micro- and nanodevicesWe acknowledge funding from the Spanish MINECO (FIS2015-64951-R, MAT2014-53432- C5-5-R, FIS2014-53488-P, FIS2017-84057-P), the Comunidad de Madrid (S2013/MIT-2740), the European Union Seventh Framework Programme (FP7-PEOPLE-2013-CIG- 630996, FP7-PEOPLE-2013-CIG-618229), and the European Research Council (ERC-2011-AdG-290981 and ERC-2016- STG-714870). V.F.-H. acknowledges support from “la Caixa” Foundation and J.C.C. thanks the DFG and SFB767 for sponsoring his stay at the University of Konstanz as Mercator Fello

    A NFV system to support configurable and automated multi-UAV service deployments

    Get PDF
    Proceeding of: DroNet 2018, 4th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications (Co-located with ACM MobiSys 2018)In this paper, we explore the strong potential of Network Function Virtualization (NFV) technologies to enable multi-mission small unmanned aircraft systems. In this context, we analyze the main challenges of using NFV technologies in this emergent field, and we present the design of an NFV system that supports the flexible, automated and cost-effective deployment of network services over small unmanned aerial vehicles. To validate our design, we implemented its most relevant components with open-source technologies, using this first prototype of the system to carry out a set of preliminary experiments that showcase its feasibility and functionality.This article has been partially supported by the European H2020 5GinFIRE project (grant agreement 732497), and by the 5GCity project (TEC2016-76795- C6-3-R) funded by the Spanish Ministry of Economy and Competitiveness

    Soft MIMO detection through sphere decoding and box optimization

    Full text link
    [EN] Achieving optimal detection performance with low complexity is one of the major challenges, mainly in multiple-input multiple-output (MIMO) detection. This paper presents three low-complexity Soft-Output MIMO detection algorithms that are based mainly on Box Optimization (BO) techniques. The proposed methods provide good performance with low computational cost using continuous constrained optimization techniques. The rst proposed algorithm is a non-optimal Soft-Output detector of reduced complexity. This algorithm has been compared with the Soft-Output Fixed Complexity (SFSD) algorithm, obtaining lower complexity and similar performance. The two remaining algorithms are employed in a turbo receiver, achieving the max-log Maximum a Posteriori (MAP) performance. The two Soft-Input Soft-Output (SISO) algorithms were proposed in a previous work for soft-output MIMO detection. This work presents its extension for iterative decoding. The SISO algorithms presented are developed and compared with the SISO Single Tree Search algorithm (STS), in terms of efficiency and computational cost. The results show that the proposed algorithms are more efficient for high order constellation than the STS algorithm.Simarro, MA.; García Mollá, VM.; Vidal Maciá, AM.; Martínez Zaldívar, FJ.; Gonzalez, A. (2018). Soft MIMO detection through sphere decoding and box optimization. Signal Processing. 145:48-58. https://doi.org/10.1016/j.sigpro.2017.11.010S485814
    corecore