Search results for "Networking & Telecommunications"

showing 10 items of 962 documents

A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network

2009

International audience; We propose an efficient way of constructing the wireless mesh structure associated with Molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted Weakly Connected Dominating Set structure. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. Then, we propose a centralized 2-approximation algorithm that maximizes the sum of radio link capacities in the molecular structure. Finally, we extend this protocol so that it can operate in a distributed way still providing the same guarantee. This distributed protocol is self-stabilizing thus robust to topology…

Computer scienceDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Mesh networking0102 computer and information sciences02 engineering and technologyNetwork topology01 natural sciencesConnected dominating setlaw.invention[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]law0202 electrical engineering electronic engineering information engineeringComputer Science::Networking and Internet ArchitectureWireless mesh network[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]business.industryRadio Link ProtocolComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPacket forwarding020206 networking & telecommunicationsOrder One Network Protocol010201 computation theory & mathematicsbusinessAssignment problemComputer network
researchProduct

Nonnegative Tensor Train Decompositions for Multi-domain Feature Extraction and Clustering

2016

Tensor train (TT) is one of the modern tensor decomposition models for low-rank approximation of high-order tensors. For nonnegative multiway array data analysis, we propose a nonnegative TT (NTT) decomposition algorithm for the NTT model and a hybrid model called the NTT-Tucker model. By employing the hierarchical alternating least squares approach, each fiber vector of core tensors is optimized efficiently at each iteration. We compared the performances of the proposed method with a standard nonnegative Tucker decomposition (NTD) algorithm by using benchmark data sets including event-related potential data and facial image data in multi-domain feature extraction and clustering tasks. It i…

Computer scienceFiber (mathematics)business.industryFeature extraction020206 networking & telecommunicationsPattern recognition010103 numerical & computational mathematics02 engineering and technology01 natural sciencesImage (mathematics)Multi domainCore (graph theory)0202 electrical engineering electronic engineering information engineeringDecomposition (computer science)TensorArtificial intelligence0101 mathematicsCluster analysisbusinessTucker decomposition
researchProduct

The Impact of Human Walking on the Time-Frequency Distribution of In-Home Radio Channels

2018

Passive activity recognition of home occupants has become a very hot topic in the area of radio communications, as it enables the development of cutting-edge healthcare monitoring solutions. Thanks to ubiquitous radio waves, such as WiFi signals, at today's homes, one can process radio waves reflected off a person's body for identifying certain mobility patterns. This new approach ignores the need for any wearable sensors. This paper reports a challenging indoor radio channel measurement campaign at 5.9 GHz, which has been conducted to study the impact of walking persons on the temporal and spectral properties of the channel. In particular, the time-frequency distribution of the channel has…

Computer scienceFingerprint (computing)Real-time computingProcess (computing)Wearable computer020206 networking & telecommunications02 engineering and technologyActivity recognition0202 electrical engineering electronic engineering information engineeringSpectrogram020201 artificial intelligence & image processingRadio waveCommunication channelEnvelope (motion)2018 Asia-Pacific Microwave Conference (APMC)
researchProduct

Enhancing the Resolution of the Spectrogram of Non-Stationary Mobile Radio Channels by Using Massive MIMO Techniques

2017

This paper is concerned with the enhancement of the resolution of the spectrogram of non-stationary mobile radio channels using massive multiple-input multiple-output (MIMO) techniques. By starting from a new generic geometrical model for a non-stationary MIMO channel, we derive the complex MIMO channel gains under the assumption that the mobile station (MS) moves with time-variant speed. Closed-form solutions are derived for the spectrogram of the complex MIMO channel gains by using a Gaussian window. It is shown that the window spread can be optimized subject to the MS's speed change. Furthermore, it is shown that the spectrogram can be split into an auto-term and a cross-term. The auto-t…

Computer scienceGaussian010401 analytical chemistryMIMO020206 networking & telecommunications02 engineering and technologyInterference (wave propagation)01 natural sciencesSpectral line0104 chemical sciencesTime–frequency analysissymbols.namesake0202 electrical engineering electronic engineering information engineeringsymbolsSpectrogramDoppler effectAlgorithmComputer Science::Information Theory
researchProduct

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. …

Computer scienceGaussianCentroid020206 networking & telecommunications02 engineering and technologyFunction (mathematics)Least squaressymbols.namesakeQuadratic equationExpectation–maximization algorithm0202 electrical engineering electronic engineering information engineeringsymbolsRadial basis functionLinear combinationCartography2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)
researchProduct

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…

Computer scienceGroup (mathematics)020206 networking & telecommunications02 engineering and technologySparse approximationNon-negative matrix factorizationSet (abstract data type)Constraint (information theory)Computer Science::Computer Vision and Pattern Recognition0202 electrical engineering electronic engineering information engineeringSource separation020201 artificial intelligence & image processingJoint (audio engineering)Sparse regularizationAlgorithm2020 28th European Signal Processing Conference (EUSIPCO)
researchProduct

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…

Computer scienceImage qualityComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologyIterative reconstructionmultidimensional function decompositionSuperposition principleRobustness (computer science)[ INFO.INFO-TI ] Computer Science [cs]/Image Processing0202 electrical engineering electronic engineering information engineeringComputer visionsignal processingspatial scalability.Image resolutionImage restorationSignal processingPixelbusiness.industryprogressive image transmissionGeneral Engineering020206 networking & telecommunicationsAtomic and Molecular Physics and Opticsfunctional representation[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]Computer Science::Computer Vision and Pattern RecognitionKolmogorov superposition theorem020201 artificial intelligence & image processingTomographyArtificial intelligencebusinessDigital filterAlgorithmspatial scalabilityImage compression
researchProduct

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 …

Computer scienceMatemáticasMonte Carlo methodPopulation02 engineering and technologyMachine learningcomputer.software_genre01 natural sciences010104 statistics & probability[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0202 electrical engineering electronic engineering information engineering0101 mathematicseducationComputingMilieux_MISCELLANEOUSeducation.field_of_studybusiness.industryEstimator020206 networking & telecommunicationsStatistical classificationRandom measureMonte Carlo integrationData miningArtificial intelligencebusinessParticle filtercomputer[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingImportance sampling
researchProduct

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.

Computer scienceMonte Carlo methodErgodicity020206 networking & telecommunications02 engineering and technologyFilter (signal processing)Bayesian inferenceStatistics::ComputationSet (abstract data type)Metropolis–Hastings algorithm[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingTransmission (telecommunications)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingParticle filter[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingAlgorithmComputingMilieux_MISCELLANEOUS2018 IEEE Statistical Signal Processing Workshop (SSP)
researchProduct

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…

Computer scienceMonte Carlo methodMarkov processSlice samplingProbability density function02 engineering and technologyMultiple-try MetropolisBayesian inferenceMachine learningcomputer.software_genre01 natural sciencesHybrid Monte Carlo010104 statistics & probabilitysymbols.namesake[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0202 electrical engineering electronic engineering information engineering0101 mathematicsComputingMilieux_MISCELLANEOUSMarkov chainbusiness.industryRejection samplingSampling (statistics)020206 networking & telecommunicationsMarkov chain Monte CarloMetropolis–Hastings algorithmsymbolsMonte Carlo method in statistical physicsMonte Carlo integrationArtificial intelligencebusinessParticle filter[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingcomputerAlgorithmImportance samplingMonte Carlo molecular modeling
researchProduct