Attentive monitoring of multiple video streams driven by a Bayesian foraging strategy

In this paper we shall consider the problem of deploying attention to subsets of the video streams for collating the most relevant data and information of interest related to a given task. We formalize this monitoring problem as a foraging problem. We propose a probabilistic framework to model observer's attentive behavior as the behavior of a forager. The forager, moment to moment, focuses its attention on the most informative stream/camera, detects interesting objects or activities, or switches to a more profitable stream. The approach proposed here is suitable to be exploited for multi-stream video summarization. Meanwhile, it can serve as a preliminary step for more sophisticated video surveillance, e.g. activity and behavior analysis. Experimental results achieved on the UCR Videoweb Activities Dataset, a publicly available dataset, are presented to illustrate the utility of the proposed technique.Comment: Accepted to IEEE Transactions on Image Processin

How linear features alter predator movement and the functional\ud response

In areas of oil and gas exploration, seismic lines have been reported to alter the movement patterns of wolves (Canis lupus). We developed a mechanistic first passage time model, based on an anisotropic elliptic partial differential equation, and used this to explore how wolf movement responses to seismic lines influence the encounter rate of the wolves with their prey. The model was parametrized using 5 min GPS location data. These data showed that wolves travelled faster on seismic lines and had a higher probability of staying on a seismic line once they were on it. We simulated wolf movement on a range of seismic line densities and drew implications for the rate of predator–prey interactions as described by the functional response. The functional response exhibited a more than linear increase with respect to prey density (type III) as well as interactions with seismic line density. Encounter rates were significantly higher in landscapes with high seismic line density and were most pronounced at low prey densities. This suggests that prey at low population densities are at higher risk in environments with a high seismic line density unless they learn to avoid them

Data Storage and Dissemination in Pervasive Edge Computing Environments

Nowadays, smart mobile devices generate huge amounts of data in all sorts of gatherings. Much of that data has localized and ephemeral interest, but can be of great use if shared among co-located devices. However, mobile devices often experience poor connectivity, leading to availability issues if application storage and logic are fully delegated to a remote cloud infrastructure. In turn, the edge computing paradigm pushes computations and storage beyond the data center, closer to end-user devices where data is generated and consumed. Hence, enabling the execution of certain components of edge-enabled systems directly and cooperatively on edge devices. This thesis focuses on the design and evaluation of resilient and efficient data storage and dissemination solutions for pervasive edge computing environments, operating with or without access to the network infrastructure. In line with this dichotomy, our goal can be divided into two specific scenarios. The first one is related to the absence of network infrastructure and the provision of a transient data storage and dissemination system for networks of co-located mobile devices. The second one relates with the existence of network infrastructure access and the corresponding edge computing capabilities. First, the thesis presents time-aware reactive storage (TARS), a reactive data storage and dissemination model with intrinsic time-awareness, that exploits synergies between the storage substrate and the publish/subscribe paradigm, and allows queries within a specific time scope. Next, it describes in more detail: i) Thyme, a data storage and dis- semination system for wireless edge environments, implementing TARS; ii) Parsley, a flexible and resilient group-based distributed hash table with preemptive peer relocation and a dynamic data sharding mechanism; and iii) Thyme GardenBed, a framework for data storage and dissemination across multi-region edge networks, that makes use of both device-to-device and edge interactions. The developed solutions present low overheads, while providing adequate response times for interactive usage and low energy consumption, proving to be practical in a variety of situations. They also display good load balancing and fault tolerance properties.Resumo Hoje em dia, os dispositivos móveis inteligentes geram grandes quantidades de dados em todos os tipos de aglomerações de pessoas. Muitos desses dados têm interesse loca- lizado e efêmero, mas podem ser de grande utilidade se partilhados entre dispositivos co-localizados. No entanto, os dispositivos móveis muitas vezes experienciam fraca co- nectividade, levando a problemas de disponibilidade se o armazenamento e a lógica das aplicações forem totalmente delegados numa infraestrutura remota na nuvem. Por sua vez, o paradigma de computação na periferia da rede leva as computações e o armazena- mento para além dos centros de dados, para mais perto dos dispositivos dos utilizadores finais onde os dados são gerados e consumidos. Assim, permitindo a execução de certos componentes de sistemas direta e cooperativamente em dispositivos na periferia da rede. Esta tese foca-se no desenho e avaliação de soluções resilientes e eficientes para arma- zenamento e disseminação de dados em ambientes pervasivos de computação na periferia da rede, operando com ou sem acesso à infraestrutura de rede. Em linha com esta dico- tomia, o nosso objetivo pode ser dividido em dois cenários específicos. O primeiro está relacionado com a ausência de infraestrutura de rede e o fornecimento de um sistema efêmero de armazenamento e disseminação de dados para redes de dispositivos móveis co-localizados. O segundo diz respeito à existência de acesso à infraestrutura de rede e aos recursos de computação na periferia da rede correspondentes. Primeiramente, a tese apresenta armazenamento reativo ciente do tempo (ARCT), um modelo reativo de armazenamento e disseminação de dados com percepção intrínseca do tempo, que explora sinergias entre o substrato de armazenamento e o paradigma pu- blicação/subscrição, e permite consultas num escopo de tempo específico. De seguida, descreve em mais detalhe: i) Thyme, um sistema de armazenamento e disseminação de dados para ambientes sem fios na periferia da rede, que implementa ARCT; ii) Pars- ley, uma tabela de dispersão distribuída flexível e resiliente baseada em grupos, com realocação preventiva de nós e um mecanismo de particionamento dinâmico de dados; e iii) Thyme GardenBed, um sistema para armazenamento e disseminação de dados em redes multi-regionais na periferia da rede, que faz uso de interações entre dispositivos e com a periferia da rede. As soluções desenvolvidas apresentam baixos custos, proporcionando tempos de res- posta adequados para uso interativo e baixo consumo de energia, demonstrando serem práticas nas mais diversas situações. Estas soluções também exibem boas propriedades de balanceamento de carga e tolerância a faltas

Subglobal Climate Agreements and Energy-Intensive Activities: Is there a Carbon Haven for Copper?

Subglobal climate policies induce changes in international competitiveness and favor a relocation of carbon-emitting activities. We argue that many energy-intensive activities are also capital-intensive, so that carbon policies could affect rents rather than abatement or location. Taking copper as an example, we formulate a plant-level spatial equilibrium model of the industry, and we estimate a set of elasticities to calibrate the behavioral parameters of the model. Given 2007 market conditions, Monte Carlo simulations suggest that a $50/tCO2 tax in industrialized countries induces emissions reductions of less than one percent in the copper industry, with a mean emission leakage rate of 25%. Our results conform with empirical findings on the pollution haven effect but challenge projections from computable general equilibrium models.Massachusetts Institute of Technology. Center for Energy and Environmental Policy Researc

Design, implementation and experimental evaluation of a network-slicing aware mobile protocol stack

Mención Internacional en el título de doctorWith the arrival of new generation mobile networks, we currently observe a paradigm shift, where monolithic network functions running on dedicated hardware are now implemented as software pieces that can be virtualized on general purpose hardware platforms. This paradigm shift stands on the softwarization of network functions and the adoption of virtualization techniques. Network Function Virtualization (NFV) comprises softwarization of network elements and virtualization of these components. It brings multiple advantages: (i) Flexibility, allowing an easy management of the virtual network functions (VNFs) (deploy, start, stop or update); (ii) efficiency, resources can be adequately consumed due to the increased flexibility of the network infrastructure; and (iii) reduced costs, due to the ability of sharing hardware resources. To this end, multiple challenges must be addressed to effectively leverage of all these benefits. Network Function Virtualization envisioned the concept of virtual network, resulting in a key enabler of 5G networks flexibility, Network Slicing. This new paradigm represents a new way to operate mobile networks where the underlying infrastructure is "sliced" into logically separated networks that can be customized to the specific needs of the tenant. This approach also enables the ability of instantiate VNFs at different locations of the infrastructure, choosing their optimal placement based on parameters such as the requirements of the service traversing the slice or the available resources. This decision process is called orchestration and involves all the VNFs withing the same network slice. The orchestrator is the entity in charge of managing network slices. Hands-on experiments on network slicing are essential to understand its benefits and limits, and to validate the design and deployment choices. While some network slicing prototypes have been built for Radio Access Networks (RANs), leveraging on the wide availability of radio hardware and open-source software, there is no currently open-source suite for end-to-end network slicing available to the research community. Similarly, orchestration mechanisms must be evaluated as well to properly validate theoretical solutions addressing diverse aspects such as resource assignment or service composition. This thesis contributes on the study of the mobile networks evolution regarding its softwarization and cloudification. We identify software patterns for network function virtualization, including the definition of a novel mobile architecture that squeezes the virtualization architecture by splitting functionality in atomic functions. Then, we effectively design, implement and evaluate of an open-source network slicing implementation. Our results show a per-slice customization without paying the price in terms of performance, also providing a slicing implementation to the research community. Moreover, we propose a framework to flexibly re-orchestrate a virtualized network, allowing on-the-fly re-orchestration without disrupting ongoing services. This framework can greatly improve performance under changing conditions. We evaluate the resulting performance in a realistic network slicing setup, showing the feasibility and advantages of flexible re-orchestration. Lastly and following the required re-design of network functions envisioned during the study of the evolution of mobile networks, we present a novel pipeline architecture specifically engineered for 4G/5G Physical Layers virtualized over clouds. The proposed design follows two objectives, resiliency upon unpredictable computing and parallelization to increase efficiency in multi-core clouds. To this end, we employ techniques such as tight deadline control, jitter-absorbing buffers, predictive Hybrid Automatic Repeat Request, and congestion control. Our experimental results show that our cloud-native approach attains > 95% of the theoretical spectrum efficiency in hostile environments where stateof- the-art architectures collapse.This work has been supported by IMDEA Networks InstitutePrograma de Doctorado en Ingeniería Telemática por la Universidad Carlos III de MadridPresidente: Francisco Valera Pintor.- Secretario: Vincenzo Sciancalepore.- Vocal: Xenofon Fouka

How linear features alter predator movement and the functional response

In areas of oil and gas exploration, seismic lines have been reported to alter the movement patterns of wolves (Canis lupus). We developed a mechanistic first passage time model, based on an anisotropic elliptic partial differential equation, and used this to explore how wolf movement responses to seismic lines influence the encounter rate of the wolves with their prey. The model was parametrized using 5 min GPS location data. These data showed that wolves travelled faster on seismic lines and had a higher probability of staying on a seismic line once they were on it. We simulated wolf movement on a range of seismic line densities and drew implications for the rate of predator–prey interactions as described by the functional response. The functional response exhibited a more than linear increase with respect to prey density (type III) as well as interactions with seismic line density. Encounter rates were significantly higher in landscapes with high seismic line density and were most pronounced at low prey densities. This suggests that prey at low population densities are at higher risk in environments with a high seismic line density unless they learn to avoid them

Groundswell : Preparing for Internal Climate Migration

This report, which focuses on three regions—Sub-Saharan Africa, South Asia, and Latin America that together represent 55 percent of the developing world’s population—finds that climate change will push tens of millions of people to migrate within their countries by 2050. It projects that without concrete climate and development action, just over 143 million people—or around 2.8 percent of the population of these three regions—could be forced to move within their own countries to escape the slow-onset impacts of climate change. They will migrate from less viable areas with lower water availability and crop productivity and from areas affected by rising sea level and storm surges. The poorest and most climate vulnerable areas will be hardest hit. These trends, alongside the emergence of “hotspots” of climate in- and out-migration, will have major implications for climate-sensitive sectors and for the adequacy of infrastructure and social support systems. The report finds that internal climate migration will likely rise through 2050 and then accelerate unless there are significant cuts in greenhouse gas emissions and robust development action

Using surface waves recorded by a large mesh of three-element arrays to detect and locate disparate seismic sources

Author Posting. © The Authors, 2018. This article is posted here by permission of The Royal Astronomical Society for personal use, not for redistribution. The definitive version was published in Geophysical Journal International 215 (2018): 942–958, doi:10.1093/gji/ggy316.Surface waves recorded by global arrays have proven useful for locating tectonic earthquakes and in detecting slip events depleted in high frequency, such as glacial quakes. We develop a novel method using an aggregation of small- to continental-scale arrays to detect and locate seismic sources with Rayleigh waves at 20–50 s period. The proposed method is a hybrid approach including first dividing a large aperture aggregate array into Delaunay triangular subarrays for beamforming, and then using the resolved surface wave propagation directions and arrival times from the subarrays as data to formulate an inverse problem to locate the seismic sources and their origin times. The approach harnesses surface wave coherence and maximizes resolution of detections by combining measurements from stations spanning the whole U.S. continent. We tested the method with earthquakes, glacial quakes and landslides. The results show that the method can effectively resolve earthquakes as small as ∼M3 and exotic slip events in Greenland. We find that the resolution of the locations is non-uniform with respect to azimuth, and decays with increasing distance between the source and the array when no calibration events are available. The approach has a few advantages: the method is insensitive to seismic event type, it does not require a velocity model to locate seismic sources, and it is computationally efficient. The method can be adapted to real-time applications and can help in identifying new classes of seismic sources.WF is currently supported by the Postdoctoral Scholar Program at the Woods Hole Oceanographic Institution, with funding provided by the Weston Howland Jr. Postdoctoral Scholarship. This work was supported by National Science Foundation grant EAR-1358520 at Scripps Institution of Oceanography, UC San Diego

Study, evaluation and contributions to new algorithms for the embedding problem in a network virtualization environment

Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change and to enable a new business model decoupling the network services from the underlying infrastructure. The problem of embedding virtual networks in a substrate network is the main resource allocation challenge in network virtualization and is usually referred to as the Virtual Network Embedding (VNE) problem. VNE deals with the allocation of virtual resources both in nodes and links. Therefore, it can be divided into two sub-problems: Virtual Node Mapping where virtual nodes have to be allocated in physical nodes and Virtual Link Mapping where virtual links connecting these virtual nodes have to be mapped to paths connecting the corresponding nodes in the substrate network. Application of network virtualization relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as VNE algorithms. This thesis proposes a set of contributions to solve the research challenges of the VNE that have not been tackled by the research community. To do that, it performs a deep and comprehensive survey of virtual network embedding. The first research challenge identified is the lack of proposals to solve the virtual link mapping stage of VNE using single path in the physical network. As this problem is NP-hard, existing proposals solve it using well known shortest path algorithms that limit the mapping considering just one constraint. This thesis proposes the use of a mathematical multi-constraint routing framework called paths algebra to solve the virtual link mapping stage. Besides, the thesis introduces a new demand caused by virtual link demands into physical nodes acting as intermediate (hidden) hops in a path of the physical network. Most of the current VNE approaches are centralized. They suffer of scalability issues and provide a single point of failure. In addition, they are not able to embed virtual network requests arriving at the same time in parallel. To solve this challenge, this thesis proposes a distributed, parallel and universal virtual network embedding framework. The proposed framework can be used to run any existing embedding algorithm in a distributed way. Thereby, computational load for embedding multiple virtual networks is spread across the substrate network Energy efficiency is one of the main challenges in future networking environments. Network virtualization can be used to tackle this problem by sharing hardware, instead of requiring dedicated hardware for each instance. Until now, VNE algorithms do not consider energy as a factor for the mapping. This thesis introduces the energy aware VNE where the main objective is to switch off as many network nodes and interfaces as possible by allocating the virtual demands to a consolidated subset of active physical networking equipment. To evaluate and validate the aforementioned VNE proposals, this thesis helped in the development of a software framework called ALgorithms for Embedding VIrtual Networks (ALEVIN). ALEVIN allows to easily implement, evaluate and compare different VNE algorithms according to a set of metrics, which evaluate the algorithms and compute their results on a given scenario for arbitrary parameters