Search results for "Telecommunication"

showing 10 items of 1769 documents

Capture Aware Sequential Waterfilling for LoraWAN Adaptive Data Rate

2020

LoRaWAN (Long Range Wide Area Network) is emerging as an attractive network infrastructure for ultra low power Internet of Things devices. Even if the technology itself is quite mature and specified, the currently deployed wireless resource allocation strategies are still coarse and based on rough heuristics. This paper proposes an innovative "sequential waterfilling" strategy for assigning Spreading Factors (SF) to End-Devices (ED). Our design relies on three complementary approaches: i) equalize the Time-on-Air of the packets transmitted by the system's EDs in each spreading factor's group; ii) balance the spreading factors across multiple access gateways, and iii) keep into account the c…

FOS: Computer and information sciencesComputer scienceDistributed computingInternet of ThingsWireless communicationresource allocationServers02 engineering and technologyNetwork topologyspreading factorsinter-SF interferenceComputer Science - Networking and Internet Architecturechannel captureBandwidthServerLPWAN0202 electrical engineering electronic engineering information engineeringWirelessComputer architectureElectrical and Electronic Engineeringinternet of t6hingsNetworking and Internet Architecture (cs.NI)Network packetbusiness.industryApplied MathematicsResource managementinternet of t6hings; LoRaWAN; spreading factors; resource allocation; adaptive data rate; channel capture; inter-SF interference020206 networking & telecommunicationsComputer Science ApplicationsLoRaWANadaptive data rateWide area networkScalabilityHeuristicsbusinessInterferenceUplinkCommunication channel
researchProduct

A Review of Multiple Try MCMC algorithms for Signal Processing

2018

Many applications in signal processing require the estimation of some parameters of interest given a set of observed data. More specifically, Bayesian inference needs the computation of {\it a-posteriori} estimators which are often expressed as complicated multi-dimensional integrals. Unfortunately, analytical expressions for these estimators cannot be found in most real-world applications, and Monte Carlo methods are the only feasible approach. A very powerful class of Monte Carlo techniques is formed by the Markov Chain Monte Carlo (MCMC) algorithms. They generate a Markov chain such that its stationary distribution coincides with the target posterior density. In this work, we perform a t…

FOS: Computer and information sciencesComputer scienceMonte Carlo methodMachine Learning (stat.ML)02 engineering and technologyMultiple-try MetropolisBayesian inference01 natural sciencesStatistics - Computation010104 statistics & probabilitysymbols.namesakeArtificial IntelligenceStatistics - Machine Learning0202 electrical engineering electronic engineering information engineering0101 mathematicsElectrical and Electronic EngineeringComputation (stat.CO)Signal processingMarkov chainApplied MathematicsEstimator020206 networking & telecommunicationsMarkov chain Monte CarloStatistics::ComputationComputational Theory and MathematicsSignal ProcessingsymbolsSample spaceComputer Vision and Pattern RecognitionStatistics Probability and UncertaintyAlgorithm
researchProduct

Impact of LTE’s Periodic Interference on Heterogeneous Wi-Fi Transmissions

2018

The problem of Wi-Fi and LTE coexistence has been significantly debated in the last years, with the emergence of LTE extensions enabling the utilization of unlicensed spectrum for carrier aggregation. Rather than focusing on the problem of resource sharing between the two technologies, in this paper, we study the effects of LTE's structured transmissions on the Wi-Fi random access protocol. We show how the scheduling of periodic LTE transmissions modifies the behavior of 802.11's distributed coordination function (DCF), leading to a degradation of Wi-Fi performance, both in terms of channel utilization efficiency and in terms of channel access fairness. We also discuss the applicability and…

FOS: Computer and information sciencesComputer scienceThroughput02 engineering and technologyDistributed coordination functionSpectrum managementAnalytical modelScheduling (computing)Computer Science - Networking and Internet ArchitectureC.2.0C.2.50202 electrical engineering electronic engineering information engineeringLong Term EvolutionWireless fidelityElectrical and Electronic EngineeringProbabilitySensorNetworking and Internet Architecture (cs.NI)business.industrySettore ING-INF/03 - TelecomunicazioniComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsComputer Science Applications1707 Computer Vision and Pattern RecognitionThroughput91A06 91A10 91A80Computer Science ApplicationsShared resourceModeling and SimulationbusinessC.2.0; C.2.5InterferenceRandom accessComputer networkCommunication channel
researchProduct

An exploratory study of COVID-19 misinformation on Twitter.

2020

During the COVID-19 pandemic, social media has become a home ground for misinformation. To tackle this infodemic, scientific oversight, as well as a better understanding by practitioners in crisis management, is needed. We have conducted an exploratory study into the propagation, authors and content of misinformation on Twitter around the topic of COVID-19 in order to gain early insights. We have collected all tweets mentioned in the verdicts of fact-checked claims related to COVID-19 by over 92 professional fact-checking organisations between January and mid-July 2020 and share this corpus with the community. This resulted in 1 500 tweets relating to 1 274 false and 276 partially false cla…

FOS: Computer and information sciencesCoronavirus disease 2019 (COVID-19)Computer Networks and CommunicationsDiffusion of informationInternet privacyTwitterExploratory research02 engineering and technologyCrisis managementFalse accusationArticleSocial mediaComputer Science - Computers and SocietyOrder (exchange)Computers and Society (cs.CY)0202 electrical engineering electronic engineering information engineeringSocial mediaMisinformationSocial and Information Networks (cs.SI)business.industryCommunicationCOVID-19Computer Science - Social and Information Networks020206 networking & telecommunicationsExploratory analysisVDP::Samfunnsvitenskap: 200::Sosiologi: 220CoronavirusInformatikFake newsMisinformation020201 artificial intelligence & image processingPsychologybusinessInformation SystemsOnline social networks and media
researchProduct

A note on easy and efficient computation of full abelian periods of a word

2016

Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\log\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Elementary abelian groupComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technology[INFO] Computer Science [cs]01 natural sciencesRank of an abelian groupCombinatoricsSimple (abstract algebra)Computer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsData Structures and Algorithms (cs.DS)[INFO]Computer Science [cs]Abelian groupHidden subgroup problemDiscrete Mathematics and CombinatoricComputingMilieux_MISCELLANEOUSMathematicsCombinatorics on wordDiscrete mathematicsApplied Mathematics020206 networking & telecommunicationsAbelian periodText algorithmWeak repetitionFree abelian groupAbelian powerCombinatorics on wordsDesign of algorithm010201 computation theory & mathematicsWord (computer architecture)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Descent distribution on Catalan words avoiding a pattern of length at most three

2018

Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan words avoiding a pattern of length at most three: for each such a pattern $p$ we provide a bivariate generating function where the coefficient of $x^ny^k$ in its series expansion is the number of length $n$ Catalan words with $k$ descents and avoiding $p$. As a byproduct, we enumerate the set of Catalan words avoiding $p$, and we provide the popularity of descents on this set. Some of the obtained enumerating sequences are not yet recorded in the On-line En…

FOS: Computer and information sciencesDistribution (number theory)Discrete Mathematics (cs.DM)0102 computer and information sciences02 engineering and technologyBivariate analysis01 natural sciencesTheoretical Computer ScienceCatalan numberSet (abstract data type)Combinatorics0202 electrical engineering electronic engineering information engineeringFOS: MathematicsDiscrete Mathematics and CombinatoricsMathematics - Combinatorics[MATH]Mathematics [math]MathematicsDescent (mathematics)Discrete mathematicsGenerating functionDescent020206 networking & telecommunicationslanguage.human_languagePopularity010201 computation theory & mathematicsPattern avoidancelanguageCatalanCombinatorial classCombinatorics (math.CO)Catalan wordComputer Science - Discrete Mathematics
researchProduct

Machine learning information fusion in Earth observation: A comprehensive review of methods, applications and data sources

2020

This paper reviews the most important information fusion data-driven algorithms based on Machine Learning (ML) techniques for problems in Earth observation. Nowadays we observe and model the Earth with a wealth of observations, from a plethora of different sensors, measuring states, fluxes, processes and variables, at unprecedented spatial and temporal resolutions. Earth observation is well equipped with remote sensing systems, mounted on satellites and airborne platforms, but it also involves in-situ observations, numerical models and social media data streams, among other data sources. Data-driven approaches, and ML techniques in particular, are the natural choice to extract significant i…

FOS: Computer and information sciencesEarth observationComputer Science - Machine LearningComputer scienceComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern Recognition02 engineering and technologyMachine learningcomputer.software_genreField (computer science)Machine Learning (cs.LG)Set (abstract data type)0202 electrical engineering electronic engineering information engineeringbusiness.industryData stream mining020206 networking & telecommunicationsNumerical modelsSensor fusionInformation fusionHardware and ArchitectureSignal Processing020201 artificial intelligence & image processingArtificial intelligencebusinesscomputerSoftwareInformation SystemsInformation Fusion
researchProduct

Online Computation of Abelian Runs

2015

Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period $\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\mathcal{P}$. We give an algorithm that finds all the abelian runs of period $\mathcal{P}$ in a word of length $n$ in time $O(n\times |\mathcal{P}|)$ and space $O(\sigma+|\mathcal{P}|)$.

FOS: Computer and information sciencesFormal Languages and Automata Theory (cs.FL)Abelian run[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Computer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technology[INFO] Computer Science [cs]01 natural sciencesOnline computationTheoretical Computer ScienceCombinatoricsComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)[INFO]Computer Science [cs]Abelian groupComputingMilieux_MISCELLANEOUSMathematicsCombinatorics on wordDiscrete mathematicsComputer Science (all)020206 networking & telecommunicationsAbelian periodText algorithm16. Peace & justiceSubstringCombinatorics on words010201 computation theory & mathematicsWord (group theory)Computer Science::Formal Languages and Automata Theory
researchProduct

A Proposed Access Control-Based Privacy Preservation Model to Share Healthcare Data in Cloud

2020

Healthcare data in cloud computing facilitates the treatment of patients efficiently by sharing information about personal health data between the healthcare providers for medical consultation. Furthermore, retaining the confidentiality of data and patients' identity is a another challenging task. This paper presents the concept of an access control-based (AC) privacy preservation model for the mutual authentication of users and data owners in the proposed digital system. The proposed model offers a high-security guarantee and high efficiency. The proposed digital system consists of four different entities, user, data owner, cloud server, and key generation center (KGC). This approach makes…

FOS: Computer and information sciencesKey generationComputer Science - Cryptography and Security020205 medical informaticsbusiness.industryComputer science020206 networking & telecommunicationsAccess controlCloud computing02 engineering and technologyMutual authenticationEncryptionPublic-key cryptographyData sharingComputer Science - Computers and SocietyComputers and Society (cs.CY)0202 electrical engineering electronic engineering information engineeringSession keybusinessCryptography and Security (cs.CR)Computer network2020 16th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
researchProduct

Metropolis Sampling

2017

Monte Carlo (MC) sampling methods are widely applied in Bayesian inference, system simulation and optimization problems. The Markov Chain Monte Carlo (MCMC) algorithms are a well-known class of MC methods which generate a Markov chain with the desired invariant distribution. In this document, we focus on the Metropolis-Hastings (MH) sampler, which can be considered as the atom of the MCMC techniques, introducing the basic notions and different properties. We describe in details all the elements involved in the MH algorithm and the most relevant variants. Several improvements and recent extensions proposed in the literature are also briefly discussed, providing a quick but exhaustive overvie…

FOS: Computer and information sciencesMachine Learning (stat.ML)020206 networking & telecommunications02 engineering and technologyStatistics - Computation01 natural sciencesStatistics::ComputationMethodology (stat.ME)010104 statistics & probabilityStatistics - Machine Learning0202 electrical engineering electronic engineering information engineering0101 mathematicsComputation (stat.CO)Statistics - MethodologyWiley StatsRef: Statistics Reference Online
researchProduct