Search results for "NETWORKING"
showing 10 items of 1776 documents
Experimental validation for spectrum cartography using adaptive multi-kernels
2017
This paper validates the functionality of an algorithm for spectrum cartography, generating a radio environment map (REM) using adaptive radial basis functions (RBF) based on a limited number of measurements. The power at all locations is estimated as a linear combination of different RBFs without assuming any prior information about either power spectral densities (PSD) of the transmitters or their locations. The RBFs are represented as centroids at optimized locations, using machine learning to jointly optimize their positions, weights and Gaussian decaying parameters. Optimization is performed using expectation maximization with a least squares loss function and a quadratic regularizer. …
Group Nonnegative Matrix Factorization with Sparse Regularization in Multi-set Data
2021
Constrained joint analysis of data from multiple sources has received widespread attention for that it allows us to explore potential connections and extract meaningful hidden components. In this paper, we formulate a flexible joint source separation model termed as group nonnegative matrix factorization with sparse regularization (GNMF-SR), which aims to jointly analyze the partially coupled multi-set data. In the GNMF-SR model, common and individual patterns of particular underlying factors can be extracted simultaneously with imposing nonnegative constraint and sparse penalty. Alternating optimization and alternating direction method of multipliers (ADMM) are combined to solve the GNMF-S…
A new Adaptive and Progressive Image Transmission Approach using Function Superpositions
2010
International audience; We present a novel approach to adaptive and progressive image transmission, based on the decomposition of an image into compositions and superpositions of monovariate functions. The monovariate functions are iteratively constructed and transmitted, one after the other, to progressively reconstruct the original image: the progressive transmission is performed directly in the 1D space of the monovariate functions and independently of any statistical properties of the image. Each monovariate function contains only a fraction of the pixels of the image. Each new transmitted monovariate function adds data to the previously transmitted monovariate functions. After each tra…
Progress in EU Breeding Blanket design and integration
2018
Abstract In Europe (EU), in the frame of the EUROfusion consortium activities, four Breeding Blanket (BB) concepts are being developed with the aim of fulfilling the performances required by a near-term fusion power demonstration plant (DEMO) in terms of tritium self-sufficiency and electricity production. The four blanket options cover a wide range of technological possibilities, as water and helium are considered as possible coolants and solid ceramic breeder in combination with beryllium and PbLi as tritium breeder and neutron multipliers. The strategy for the BB selection and operation has to account for the challenging schedule of the EU DEMO, the ambitious operational requirements of …
Remarks on IEEE 802.11 DCF performance analysis
2005
This letter presents a new approach to evaluate the throughput/delay performance of the 802.11 distributed coordination function (DCF). Our approach relies on elementary conditional probability arguments rather than bidimensional Markov chains (as proposed in previous models) and can be easily extended to account for backoff operation more general than DCF's one.
Adaptive Population Importance Samplers: A General Perspective
2016
Importance sampling (IS) is a well-known Monte Carlo method, widely used to approximate a distribution of interest using a random measure composed of a set of weighted samples generated from another proposal density. Since the performance of the algorithm depends on the mismatch between the target and the proposal densities, a set of proposals is often iteratively adapted in order to reduce the variance of the resulting estimator. In this paper, we review several well-known adaptive population importance samplers, providing a unified common framework and classifying them according to the nature of their estimation and adaptive procedures. Furthermore, we interpret the underlying motivation …
Distributed Particle Metropolis-Hastings Schemes
2018
We introduce a Particle Metropolis-Hastings algorithm driven by several parallel particle filters. The communication with the central node requires the transmission of only a set of weighted samples, one per filter. Furthermore, the marginal version of the previous scheme, called Distributed Particle Marginal Metropolis-Hastings (DPMMH) method, is also presented. DPMMH can be used for making inference on both a dynamical and static variable of interest. The ergodicity is guaranteed, and numerical simulations show the advantages of the novel schemes.
Group Metropolis Sampling
2017
Monte Carlo (MC) methods are widely used for Bayesian inference and optimization in statistics, signal processing and machine learning. Two well-known class of MC methods are the Importance Sampling (IS) techniques and the Markov Chain Monte Carlo (MCMC) algorithms. In this work, we introduce the Group Importance Sampling (GIS) framework where different sets of weighted samples are properly summarized with one summary particle and one summary weight. GIS facilitates the design of novel efficient MC techniques. For instance, we present the Group Metropolis Sampling (GMS) algorithm which produces a Markov chain of sets of weighted samples. GMS in general outperforms other multiple try schemes…
Recycling Gibbs sampling
2017
Gibbs sampling is a well-known Markov chain Monte Carlo (MCMC) algorithm, extensively used in signal processing, machine learning and statistics. The key point for the successful application of the Gibbs sampler is the ability to draw samples from the full-conditional probability density functions efficiently. In the general case this is not possible, so in order to speed up the convergence of the chain, it is required to generate auxiliary samples. However, such intermediate information is finally disregarded. In this work, we show that these auxiliary samples can be recycled within the Gibbs estimators, improving their efficiency with no extra cost. Theoretical and exhaustive numerical co…
Multi-agent Systems for Estimating Missing Information in Smart Cities
2019
International audience; Smart cities aim at improving the quality of life of citizens. To do this, numerous ad-hoc sensors need to be deployed in a smart city to monitor the environmental state. Even if nowadays sensors are becoming more and more cheap their installation and maintenance costs increase rapidly with their number. This paper makes an inventory of the dimensions required for designing an intelligent system to support smart city initiatives. Then we propose a multi-agent based solution that uses a limited number of sensors to estimate at runtime missing information in smart cities using a limited number of sensors.